J. O'Rourke. Computational geometry column 39. SIGACT News, 31(3):47-49, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Sum of Squares Theorem for Visibility Complexes and.. - Angelier, Pocchiola (2001) (Correct)
.... [9, 19, 38] visibility graph or visibility complex counting [37, 38, 36] covering and separation [41] collision detection [2, 25, 24, 23] stretchability and realizability of pseudoline arrangements [36, 38, 18] and, last but not least, planning expansive motions of polygonal chains [33, 12, 47]. A key feature of pseudo triangulations that is largely exploited in the applications mentioned above is the existence of a ip operation e.g. in Figure 2 the rightmost pseudo triangulation is obtained from the leftmost pseudo triangulation after a sequence of six ip operations (see also left ....
J. O'Rourke. Computational geometry column 39. SIGACT News, 31(3):47-49, 2000.
On Reconfiguring Tree Linkages: Trees can Lock - Biedl, Demaine, Demaine.. (2000) Self-citation (O'rourke) (Correct)
....straight line. Similarly, we wonder whether a cycle linkage (polygon) can always be convexified ; i.e. whether it can be moved to a configuration that is a convex polygon. If a linkage cannot be so reconfigured, it is called locked. These questions have been in the math community since the 1970 s [22] and in the computational geometry community since 1991 [18, 19] but first appeared in print in 1993 and 1995: 20] and [16, p. 270] Initial computational geometry results focused on certain classes of configurations such as visible chains [4] star shaped polygons [9] and monotone polygons ....
J. O'Rourke. Computational geometry column 39. International Journal of Computational Geometry and Applications, 2000. In press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC