121 search results - page 20 / 25 » A bound on the number of points of a plane curve |
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
CCCG
2007
13 years 8 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
CCCG
2006
13 years 8 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
CAD
2004
Springer
13 years 7 months ago
2004
Springer
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...