OpenAlex
P Complete Geometric Problems
Work
Year: 1993
Type: article
Abstract: In this paper we show that it is impossible to solve a number of “natural” two-dimensional geometric problems in polylog time with a polynomial number of processors (unless P=NC). Thus, we disprove a ... more
Source: International Journal of Computational Geometry & Applications
Authors Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich
Institutions Purdue University West Lafayette, Johns Hopkins University
Cites:
Cited by: 16
Related to: 10
FWCI: 0.448
Citation percentile (by year/subfield): 77.56
Topic: Computational Geometry and Mesh Generation
Subfield: Computer Graphics and Computer-Aided Design
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Sustainable cities and communities
Open Access status: green