1604 search results - page 188 / 321 » Regularization on Discrete Spaces |
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
SGP
2007
14 years 19 days ago
2007
Developable surfaces are surfaces that can be unfolded into the plane with no distortion. Although ubiquitous in our everyday surroundings, modeling them using existing tools requ...
COMPGEOM
2005
ACM
14 years 5 days ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...