110
click to vote
CCCG
14 years 10 months ago
2006 
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
64
Voted
CCCG
14 years 10 months ago
2006 
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
CCCG
14 years 10 months ago
2006 
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
CCCG
14 years 10 months ago
2006 
Geometric constraints solving often relies on graphbased methods to decompose systems of geometric constraints. These methods have intrinsic and unavoidable limitations which are ...
CCCG
14 years 10 months ago
2006 
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
|
Computational Geometry