Sciweavers

205 search results - page 22 / 41
» On Deletion in Delaunay Triangulations
Sort
View
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
14 years 8 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi
ICDAR
2007
IEEE
14 years 1 months ago
Knowledge-Based Recognition of Utility Map Sub-Diagrams
An integrated map of all utility services in a locale would facilitate better management of the road infrastructure and the utilities themselves. To meet this goal, there exists a...
Simon J. Hickinbotham, Anthony G. Cohn
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...
ICPR
2010
IEEE
13 years 10 months ago
Triangle-Constraint for Finding More Good Features
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Xiaojie Guo, Xiaochun Cao