Point location in zones of k-flats in arrangements

DOI10.1016/0925-7721(95)00021-6MaRDI QIDQ1917049zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mark de Berg, Marc Van Kreveld, Otfried Cheong, Jack Snoeyink

Publication date 14 July 1996

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0925-7721(95)00021-6

zbMATH Keywords

arrangementpoint location

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4074477
• A note on point location in arrangements of hyperplanes
• Point location among hyperplanes and unidirectional ray-shooting
• Point location in arrangements of hyperplanes

Cites work

• -nets and simplex range queries
• A Randomized Algorithm for Closest-Point Queries
• Applications of random sampling in computational geometry. II
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Cutting hyperplane arrangements
• scientific article; zbMATH DE number 410386 (Why is no real title available?)
• scientific article; zbMATH DE number 432784 (Why is no real title available?)
• scientific article; zbMATH DE number 4151829 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 177535 (Why is no real title available?)
• Linear Programming in Linear Time When the Dimension Is Fixed
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Lines in space: Combinatorics and algorithms
• On k-Hulls and Related Problems
• On lazy randomized incremental construction
• On ray shooting in convex polytopes
• On the zone of a surface in a hyperplane arrangement
• On the Zone Theorem for Hyperplane Arrangements
• Point location among hyperplanes and unidirectional ray-shooting
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• Reporting points in halfspaces
• Small-dimensional linear programming and convex hulls made easy

This page was built for publication: Point location in zones of \(k\)-flats in arrangements

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