Sciweavers

DICTA
2003
14 years 7 days ago
Text String Extraction in Delaunay Triangulation
This paper establishes a Delaunay triangulation model for detecting text strings in an image. In this method, text regions are represented based on Delaunay triangles that can be e...
Huimin Grace Guo, Yi Xiao, Hong Yan
CCCG
2003
14 years 7 days ago
Computing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
Ali Asghar Khanban, Abbas Edalat
CCCG
2008
14 years 9 days ago
An Efficient Query Structure for Mesh Refinement
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
Benoît Hudson, Duru Türkoglu
CCCG
2010
14 years 9 days ago
Blocking delaunay triangulations
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl,...
COMPGEOM
2008
ACM
14 years 19 days 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
2005
ACM
14 years 24 days 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
ICALP
1991
Springer
14 years 2 months ago
The Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to...
Marshall W. Bern, David Eppstein, F. Frances Yao
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
14 years 2 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
DGCI
2006
Springer
14 years 2 months ago
Topologically Correct Image Segmentation Using Alpha Shapes
Abstract. Existing theories on shape digitization impose strong constraints on feasible shapes and require error-free measurements. We use Delaunay triangulation and -shapes to pro...
Peer Stelldinger, Ullrich Köthe, Hans Meine
PG
1999
IEEE
14 years 3 months ago
An Improved TIN Compression Using Delaunay Triangulation
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper i...
Yang-Soo Kim, Dong-Gyu Park, Ho-Youl Jung, Hwan-Gu...