CUTTINGS AND APPLICATIONS

DOI10.1142/S0218195995000210MaRDI QIDQ4858649zbMATH OpenOpenAlexFDO

Authors Mark de Berg, Otfried Cheong

Publication date 1 February 1996

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195995000210

zbMATH Keywords

cuttingssegment intersectionHopcroft's problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Other problems of combinatorial convexity (52A37)

Recommendations

• On constants for cuttings in the plane
• Cutting hyperplanes for divide-and-conquer
• Constructing Planar Cuttings in Theory and Practice
• Approximating the \(k\)-level in three-dimensional plane arrangements
• Curve-Sensitive Cuttings

Cited in

(20)

• Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
• scientific article; zbMATH DE number 3991495 (Why is no real title available?)
• Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
• New lower bounds for Hopcroft's problem
• Curve-Sensitive Cuttings
• On the Zarankiewicz problem for intersection hypergraphs
• Cuttings for disks and axis-aligned rectangles in three-space
• On counting pairs of intersecting segments and off-line triangle range searching
• Approximating the \(k\)-level in three-dimensional plane arrangements
• Cutting hyperplanes for divide-and-conquer
• The complexity of cutting complexes
• Cutting algebraic curves into pseudo-segments and applications
• On approximate range counting and depth
• Semi-algebraic off-line range searching and biclique partitions in the plane
• Optimal partition trees
• Curve-sensitive cuttings
• Removing depth-order cycles among triangles: an algorithm generating triangular fragments
• ON ENUMERATING AND SELECTING DISTANCES
• Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
• On 3SUM-hard problems in the decision tree model

This page was built for publication: CUTTINGS AND APPLICATIONS

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