Sciweavers

839 search results - page 61 / 168
» Three-Clustering of Points in the Plane
Sort
View
SIAMDM
2008
90views more  SIAMDM 2008»
13 years 9 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen
WG
2010
Springer
13 years 7 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 10 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
EJC
2008
13 years 9 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
14 years 2 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger