29908 search results - page 646 / 5982 » On the Complexity of |
164
click to vote
CCCG
2003
15 years 8 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 ...
171
click to vote
CCCG
2003
15 years 8 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...
171
click to vote
CRIWG
2003
15 years 8 months ago
2003
Abstract. There has been much research on the design of Groupware, its potential benefits and the methods used to develop systems to support groups. However, in many real life case...
206
click to vote
DLT
2003
15 years 8 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...