Output-Sensitive Construction of the Union of Triangles

DOI10.1137/S0097539704444245MaRDI QIDQ5317199zbMATH OpenOpenAlexFDO

Authors Esther Ezra, Micha Sharir

Publication date 16 September 2005

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539704444245

zbMATH Keywords

\(\epsilon\)-netfinite VC-dimensionhitting setoutput sensitivityrandom samplingset coverunion of geometric objects

Mathematics Subject Classification ID

Extremal combinatorics (05D99) Metric geometry (51F99) Combinatorial complexity of geometric structures (52C45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Recommendations

• Output-sensitive construction of the union of triangles
• OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES
• Recursive constructions for triangulations
• scientific article; zbMATH DE number 910884
• An output-sensitive algorithm for computing projections of resultant polytopes
• An output sensitive algorithm for discrete convex hulls
• scientific article; zbMATH DE number 432983
• COMPUTING THE UNION OF 3-COLORED TRIANGLES

Cited in

(2)

• scientific article; zbMATH DE number 1947415 (Why is no real title available?)
• Output-sensitive construction of the union of triangles

This page was built for publication: Output-Sensitive Construction of the Union of Triangles

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