91 search results - page 2 / 19 » Triangulating a Plane |
GM
1999
Springer
13 years 10 months ago
1999
Springer
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
COMPGEOM
2006
ACM
14 years 5 hour 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...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
SCIA
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to...
CCCG
2003
13 years 7 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...