Sciweavers

71 search results - page 3 / 15
» Optimal Triangulation with Steiner Points
Sort
View
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
15 years 3 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
FOCS
2007
IEEE
15 years 1 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...
SCIA
2007
Springer
149views Image Analysis» more  SCIA 2007»
15 years 3 months ago
Triangulation of Points, Lines and Conics
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
Klas Josephson, Fredrik Kahl
COMPGEOM
2006
ACM
15 years 3 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
15 years 4 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon