On local transformation of polygons with visibility properties.

DOI10.1016/S0304-3975(01)00409-1MaRDI QIDQ1853571zbMATH OpenFDO

Authors C. Hernando, Michael E. Houle, Ferran Hurtado

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Computational geometryEnumerationPolygonFlipLocal transformation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polytopes and polyhedra (52B99)

Recommendations

• scientific article; zbMATH DE number 1696622
• Convexifying monotone polygons while maintaining internal visibility
• Visibility-preserving convexifications using single-vertex moves
• Convexification of polygons by length preserving transformations
• A hierarchy of simple polygons.

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1021588 (Why is no real title available?)
• scientific article; zbMATH DE number 1182913 (Why is no real title available?)
• R(4, 5) = 25
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• An optimal visibility graph algorithm for triangulated simple polygons
• Combinatorial face enumeration in arrangements and oriented matroids
• Combinatorial face enumeration in convex polytopes
• Construction of three-dimensional Delaunay triangulations using local transformations
• Every planar map is four colorable
• Flipping edges in triangulations
• Generating random polygons with given vertices
• Geometric tree graphs of points in convex position
• Graph of triangulations of a convex polygon and tree of triangulations
• Graphs of non-crossing perfect matchings
• Incremental topological flipping works for regular triangulations
• Reverse search for enumeration
• Transforming triangulations

Cited in

(11)

• Algorithmic enumeration of surrounding polygons
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
• On planar path transformation
• Graphs of triangulations and perfect matchings
• Non-crossing Hamiltonian paths and cycles in output-polynomial time
• Planar tree transformation: results and counterexample
• scientific article; zbMATH DE number 1696622 (Why is no real title available?)
• Flips in planar graphs
• Computing signed permutations of polygons
• Locality of Corner Transformation for Multidimensional Spatial Access Methods
• Connecting polygonizations via stretches and twangs

Describes a project that uses

Uses Software

• Voronoi

This page was built for publication: On local transformation of polygons with visibility properties.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853571)