Better lower bounds on detecting affine and spherical degeneracies

DOI10.1007/BF02574027zbMath0815.68115OpenAlexW1986520777MaRDI QIDQ1346125

V. Pereyra

Publication date: 20 March 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131346

zbMATH Keywords

spherical degeneracies

Mathematics Subject Classification ID

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

Related Items (15)

Better lower bounds on detecting affine and spherical degeneracies ⋮ FINDING POPULAR PLACES ⋮ On a class of \(O(n^ 2)\) problems in computational geometry ⋮ Generalized hidden surface removal ⋮ The exact fitting problem in higher dimensions ⋮ On a class of \(O(n^2)\) problems in computational geometry ⋮ Unnamed Item ⋮ On the least trimmed squares estimator ⋮ Perfect binary space partitions ⋮ Unnamed Item ⋮ DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES ⋮ New lower bounds for Hopcroft's problem ⋮ Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems ⋮ On the union of fat wedges and separating a collection of segments by a line ⋮ On 3SUM-hard problems in the decision tree model

Cites Work

• Unnamed Item
• Unnamed Item
• The power of geometric duality
• Topologically sweeping an arrangement
• How good is the information theory bound in sorting?
• Lower bounds for sorting of sums
• Better lower bounds on detecting affine and spherical degeneracies
• Multidimensional Sorting
• The Intrinsic Spread of a Configuration in R d
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Lower bounds for algebraic decision trees
• On the Zone Theorem for Hyperplane Arrangements

This page was built for publication: Better lower bounds on detecting affine and spherical degeneracies