scientific article; zbMATH DE number 6876082

MaRDI QIDQ4643852zbMATH OpenFDO

Authors Bernard Chazelle

Publication date 29 May 2018

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(5)

• Approximating the k-Level in Three-Dimensional Plane Arrangements
• Partitioning axis-parallel lines in 3D
• The geodesic edge center of a simple polygon
• Lower bounds for semialgebraic range searching and stabbing problems
• An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers

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 Q4643852)