Sciweavers

221 search results - page 2 / 45
» Special Issue on Robust Geometric Algorithms and their Imple...
Sort
View
ICPR
2002
IEEE
14 years 6 months ago
The Trimmed Iterative Closest Point Algorithm
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pa...
COMPGEOM
2008
ACM
13 years 7 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
COMPGEOM
1996
ACM
13 years 9 months ago
Robust Adaptive Floating-Point Geometric Predicates
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
Jonathan Richard Shewchuk
GIS
2005
ACM
14 years 6 months ago
Use of rational numbers in the design of robust geometric primitives for three-dimensional spatial database systems
A necessary step in the implementation of three-dimensional spatial data types for spatial database systems and GIS is the development of robust geometric primitives. The authors ...
Brian E. Weinrich, Markus Schneider
VRML
1997
ACM
13 years 9 months ago
Lodestar: An Octree-Based Level of Detail Generator for VRML
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...
Dieter Schmalstieg