5786 search results - page 323 / 1158 » Lines Pinning Lines |
154
click to vote
CCCG
2007
15 years 9 months ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
183
click to vote
CCCG
2007
15 years 9 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
193
click to vote
FLAIRS
2006
15 years 9 months ago
2006
This paper discusses the production of visually appealing computer-generated images, through the emulation of human drawing techniques and artificial evolution. Employing a databa...
191
click to vote
CCCG
2001
15 years 9 months ago
2001
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. ...
196
click to vote
CCCG
2003
15 years 9 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...