Sciweavers

51 search results - page 4 / 11
» Fast Localized Delaunay Triangulation
Sort
View
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 8 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
COMPUTING
2007
126views more  COMPUTING 2007»
13 years 7 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...
FOCS
2007
IEEE
13 years 11 months ago
Inferring Local Homology from Sampled Stratified Spaces
We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a 1-parameter family...
Paul Bendich, David Cohen-Steiner, Herbert Edelsbr...
VIS
2007
IEEE
199views Visualization» more  VIS 2007»
14 years 8 months ago
Topology, Accuracy, and Quality of Isosurface Meshes Using Dynamic Particles
Abstract-This paper describes a method for constructing isosurface triangulations of sampled, volumetric, three-dimensional scalar fields. The resulting meshes consist of triangles...
Miriah Meyer, Robert M. Kirby, Ross Whitaker
ICDCSW
2009
IEEE
14 years 2 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak