Results 1  10
of
122,278
A Pointed Delaunay PseudoTriangulation of a Simple Polygon
"... We present a definition of a pointed Delaunay pseudotriangulation of a simple polygon. We discuss why our definition is reasonable. Our approach will be motivated from maximal locally convex functions, and extends the work of Aichholzer et al.[1]. Connections between the polytope of the pointed pseu ..."
Abstract
 Add to MetaCart
We present a definition of a pointed Delaunay pseudotriangulation of a simple polygon. We discuss why our definition is reasonable. Our approach will be motivated from maximal locally convex functions, and extends the work of Aichholzer et al.[1]. Connections between the polytope of the pointed
unknown title
"... A pointed Delaunay PseudoTriangulation of a simple Polygon We present a definition of a pointed Delaunay pseudotriangulation of a simple polygon. We discuss why our definition is reasonable. Our approach will be motivated from maximal locally convex functions, and extends the work of Aichholzer et ..."
Abstract
 Add to MetaCart
A pointed Delaunay PseudoTriangulation of a simple Polygon We present a definition of a pointed Delaunay pseudotriangulation of a simple polygon. We discuss why our definition is reasonable. Our approach will be motivated from maximal locally convex functions, and extends the work of Aichholzer et
Triangulating Simple Polygons: PseudoTriangulations
, 1988
"... Triangulating a given nvertex simple polygon means to partition the interior of the polygon into n − 2 triangles by adding n − 3 nonintersecting diagonals. Significant theoretical advances have recently been made in finding efficient polygon triangulation algorithms. However, there is substantial ..."
Abstract
 Add to MetaCart
diameter of the triangulationflipgraph is Θ(n2). (3) We prove the SpinNumber Theorem on simple polygons; an interesting topological result. (4) We propose a triangulation heuristic that uses the angular (deficit) indices, and the chordflip operation, in a local search to transform an initial pseudotriangulation
PseudoTriangulations  a Survey
 CONTEMPORARY MATHEMATICS
"... A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory an ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory
Compatible Pointed PseudoTriangulations
"... For a given point set S (in general position), two pointed pseudotriangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjoint compatible pointed pseudotriangulations, that is, their union is a triangulation of S. In contrast, we show that ther ..."
Abstract
 Add to MetaCart
For a given point set S (in general position), two pointed pseudotriangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjoint compatible pointed pseudotriangulations, that is, their union is a triangulation of S. In contrast, we show
Expansive motions and the polytope of pointed pseudotriangulations
 Discrete and Computational Geometry  The GoodmanPollack Festschrift, Algorithms and Combinatorics
, 2003
"... We introduce the polytope of pointed pseudotriangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1skeleton is the graph whose vertices are the pointed pseudotriang ..."
Abstract

Cited by 55 (16 self)
 Add to MetaCart
We introduce the polytope of pointed pseudotriangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1skeleton is the graph whose vertices are the pointed pseudotriangulations
Enumerating pseudotriangulations in the plane
 COMPUT. GEOM. THEORY APPL
, 2005
"... A pseudotriangle is a simple polygon with exactly three convex vertices. A pseudotriangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudotriangles whose vertices are points of S. A pointed pseudotriangulation is one which has the le ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
A pseudotriangle is a simple polygon with exactly three convex vertices. A pseudotriangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudotriangles whose vertices are points of S. A pointed pseudotriangulation is one which has
Enumerating PseudoTriangulations in the Plane
 In Proc. 14th Canad. Conf. Comp. Geom
, 2002
"... A pseudotriangle is a simple polygon with exactly three convex vertices. A minimum pseudotriangulation of a set S is a partition of the convex hull of S into the least number of interior disjoint pseudotriangles whose vertices are the points of S. The graph of pseudotriangulations G_pse has pseu ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A pseudotriangle is a simple polygon with exactly three convex vertices. A minimum pseudotriangulation of a set S is a partition of the convex hull of S into the least number of interior disjoint pseudotriangles whose vertices are the points of S. The graph of pseudotriangulations G_pse has
Contemporary Mathematics PseudoTriangulations  Survey
"... A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory a ..."
Abstract
 Add to MetaCart
A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory
Results 1  10
of
122,278