47 search results - page 8 / 10 » compgeom 2004 |
129
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
126
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
144
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
148
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
132
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...