Sciweavers

1245 search results - page 2 / 249
» Triangulation for Points on Lines
Sort
View
COCOON
2003
Springer
15 years 2 months ago
On Constrained Minimum Pseudotriangulations
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
Günter Rote, Cao An Wang, Lusheng Wang, Yin-F...
COMPGEOM
2004
ACM
15 years 3 months ago
Sampling and meshing a surface with guaranteed topology and geometry
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tath...
SGP
2007
14 years 12 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
JCO
2010
169views more  JCO 2010»
14 years 8 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
ICALP
2007
Springer
15 years 3 months ago
Size Competitive Meshing Without Large Angles
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
Gary L. Miller, Todd Phillips, Donald Sheehy