scientific article; zbMATH DE number 4213488

MaRDI QIDQ3359790zbMATH OpenFDO

Authors Pankaj K. Agarwal

Publication date 1991

zbMATH Keywords

geometric partitioning

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Partitioning arrangements of lines. II: Applications
• Efficient partition trees
• Partitioning arrangements of lines. I: An efficient deterministic algorithm
• New results on binary space partitions in the plane (extended abstract)
• Partitioning point sets in arbitrary dimension

Cited in

(10)

• Partitioning point sets in arbitrary dimension
• Guarding scenes against invasive hypercubes.
• Constructing arrangements optimally in parallel
• Geometric partitioning and robust ad-hoc network design
• scientific article; zbMATH DE number 432984 (Why is no real title available?)
• scientific article; zbMATH DE number 4062593 (Why is no real title available?)
• scientific article; zbMATH DE number 1532344 (Why is no real title available?)
• Approximating the k-Level in Three-Dimensional Plane Arrangements
• Data structures for maintaining set partitions
• Query complexity of sampling and small geometric partitions

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