scientific article; zbMATH DE number 3945384

MaRDI QIDQ3716336zbMATH OpenFDO

Authors Raimund Seidel

Publication date 1985

zbMATH Keywords

computational geometryconvex hullplanar subdivisiontriangulated pointstriangulation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 4114000
• scientific article; zbMATH DE number 4151859
• Lower bounds for maximal and convex layers problems
• scientific article; zbMATH DE number 19781
• Lower bounds for computing geometric spanners and approximate shortest paths

Cited in

(9)

• Delaunay triangulation of imprecise points in linear time after preprocessing
• Optimal time bounds for some proximity problems in the plane
• Sorting helps for Voronoi diagrams
• Neighborly inscribed polytopes and Delaunay triangulations
• A Geometric Derivation of Forney's Upper Bound
• Computing hereditary convex structures
• Lower Bounds for Geometrical and Physical Problems
• Universality theorems for inscribed polytopes and Delaunay triangulations
• Applications of generalized matrix searching to geometric algorithms

This page was built for publication:

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