Transforming pseudo-triangulations

DOI10.1016/j.ipl.2004.01.021zbMath1177.68236MaRDI QIDQ2390240

Sergey Bereg

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.01.021

zbMATH Keywords

analysis of algorithms; computational geometry; flips; pseudo-triangles; pseudo-triangulations; triangulation of a polygon

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR, Multitriangulations, pseudotriangulations and primitive sorting networks, Flips in edge-labelled pseudo-triangulations, Flips in planar graphs, A model to simplify 2D triangle meshes with irregular shapes, Transforming spanning trees and pseudo-triangulations, Flip graphs of bounded degree triangulations, Reducing Urban Concentration Using a Neural Network Model

Cites Work

• Unnamed Item
• Unnamed Item
• Time bounds for selection
• Straightening polygonal arcs and convexifying polygonal cycles
• Flipping edges in triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
• Kinetic collision detection for simple polygons