Computational geometry
- 1 March 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 25 (1) , 31-33
- https://doi.org/10.1145/181773.181777
Abstract
The class of n 2 -hard geometric problems is described, with special concentration on detecting collinearities among a set of points in the plane.Keywords
This publication has 3 references indexed in Scilit:
- Better lower bounds on detecting affine and spherical degeneraciesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient binary space partitions for hidden-surface removal and solid modelingDiscrete & Computational Geometry, 1990
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987