676 search results - page 26 / 136 » A Search-Free Intersection Algorithm |
JGTOOLS
2007
13 years 9 months ago
2007
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
CAGD
2004
13 years 9 months ago
2004
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
ECCC
2000
13 years 9 months ago
2000
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
PAMI
1998
13 years 9 months ago
1998
—We are interested in descriptions of 3D data sets, as obtained from stereo or a 3D digitizer. We therefore consider as input a sparse set of points, possibly associated with cer...
CAGD
2010
13 years 7 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...