31 search results - page 3 / 7 » cccg 2003 |
CCCG
2003
14 years 12 months ago
2003
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
67
Voted
CCCG
2003
14 years 12 months ago
2003
Given a polyhedron P in Rd with n vertices, a halfspace volume query asks for the volume of P ∩ H for a given halfspace H. We show that, for d ≥ 3, such queries can require ...
CCCG
2003
14 years 12 months ago
2003
We completely describe the structure of the connected components of transversals to a collection of n arbitrary line segments in R3 . We show that n 3 line segments in R3 admit 0,...
CCCG
2003
14 years 12 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...
78
Voted
CCCG
2003
14 years 12 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...