On local transformation of polygons with visibility properties.

DOI10.1016/S0304-3975(01)00409-1zbMATH Open1061.68168MaRDI QIDQ1853571FDOQ1853571

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

Publication date: 21 January 2003

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

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.

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)

Cites Work

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

Cited In (11)

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

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)