5 search results - page 1 / 1 » The Minimum Weight Triangulation Problem with Few Inner Poin... |
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
SODA
1992
ACM
13 years 6 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
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...
VIS
2004
IEEE
14 years 6 months ago
2004
IEEE
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...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...