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

cuttingsHopcroft's problemsegment intersection

Mathematics Subject Classification ID

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

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

(24)

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

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)