Sciweavers

1245 search results - page 16 / 249
» Triangulation for Points on Lines
Sort
View

Source Code
3955views
16 years 8 months ago
Toolbox Fast Marching - A toolbox for Fast Marching and level sets computations
Very effective Matlab library that implements the fast marching methods for both 2D/3D Cartesian spaces and triangulated surfaces (Meshes). It also implements the Farthest Point Sa...
Gabriel Peyre
VISUALIZATION
1999
IEEE
15 years 1 months ago
Spiraling Edge: Fast Surface Reconstruction from Partially Organized Sample Points
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
Patricia Crossno, Edward Angel
COMGEO
2004
ACM
14 years 9 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
COMPGEOM
2004
ACM
15 years 3 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
84
Voted
SSPR
2004
Springer
15 years 3 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...