articleTop 1% cited
Algorithms in Combinatorial Geometry.
American Mathematical Monthly · 1989 · Vol. 96(5) · pp. 457–457
Jacob E. Goodman✉Herbert Edelsbrunner(University of Illinois Urbana-Champaign)
Abstract
This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.
Computational Geometry and Mesh GenerationConstraint Satisfaction and Optimization3D Modeling in Geospatial ApplicationsGeometryDiscrete geometryComputer scienceMathematics
Citations
1,801
FWCI
65.97
field-weighted impact
References
0
Percentile
100%
vs. same field & year
Citations per year
Cited by
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys · 1991 · 4,264 citations
Three-dimensional alpha shapes
ACM Transactions on Graphics · 1994 · 2,409 citations
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers · 2003 · 524 citations
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics · 1990 · 704 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.