Sciweavers

85 search results - page 5 / 17
» Elementary Moves on Triangulations
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
COMPGEOM
2004
ACM
14 years 27 days 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
COMPGEOM
2008
ACM
13 years 9 months ago
Locally uniform anisotropic meshing
Anisotropic meshes are triangulations of a given domain in the plane or in higher dimensions, with elements elongated along prescribed directions. Anisotropic triangulations have ...
Jean-Daniel Boissonnat, Camille Wormser, Mariette ...
CAGD
2010
88views more  CAGD 2010»
13 years 7 months ago
Topological mesh operators
Abstract. In this paper we introduce an unified framework for topological manipulation on triangulated 2manifolds with or without boundary. We show that there are two kinds of prim...
Thomas Lewiner, Hélio Lopes, Esdras Medeiro...
ICRA
2006
IEEE
111views Robotics» more  ICRA 2006»
14 years 1 months ago
Placement and Distributed Deployment of Sensor Teams for Triangulation based Localization
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
Volkan Isler