A time-space trade-off for triangulations of points in the plane

DOI10.1007/978-3-319-62389-4_1MaRDI QIDQ2412397zbMATH OpenOpenAlexFDO

Authors Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri

Publication date 23 October 2017

Full work available at URL http://hdl.handle.net/11577/3228399

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Time-space trade-offs for triangulations and Voronoi diagrams
• Time-space trade-offs for triangulations and Voronoi diagrams
• Time-space trade-offs for triangulating a simple polygon
• Time-space trade-offs for triangulating a simple polygon
• scientific article; zbMATH DE number 4064506

Cited in

(11)

• Maintaining the minimal distance of a point set in polylogarithmic time
• Characterizing and efficiently computing quadrangulations of planar point sets
• Time-space trade-offs for triangulations and Voronoi diagrams
• Space-efficient algorithms for longest increasing subsequence
• A new balanced subdivision of a simple polygon for time-space trade-off algorithms
• Space-efficient algorithms for longest increasing subsequence
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
• A new balanced subdivision of a simple polygon for time-space trade-off algorithms
• Time-space trade-offs for triangulating a simple polygon
• Graph Drawing
• Triangulating input-constrained planar point sets

This page was built for publication: A time-space trade-off for triangulations of points in the plane

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