The DOI matches its Crossref record.
Algorithms in Combinatorial Geometry.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
(1999) · Cited by 3,186
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Self-citationAn optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
ɛ-nets and simplex range queries
Haussler, D., & Welzl, E. (1987) · Discrete & Computational Geometry · doi:10.1007/bf02187876 · Cited by 723
Amenta, N., Choi, S., & Kolluri, R. K. (2001) · Proceedings of the sixth ACM symposium on Solid modeling and applications · doi:10.1145/376957.376986 · Cited by 721
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Self-citationRelative neighborhood graphs and their relatives
Jaromczyk, J. W., & Toussaint, G. T. (1992) · Proceedings of the IEEE · doi:10.1109/5.163414 · Cited by 664
Geometry of the Space of Phylogenetic Trees
Billera, L. J., Holmes, S. P., & Vogtmann, K. (2001) · Advances in Applied Mathematics · doi:10.1006/aama.2001.0759 · Cited by 611
Coverage in wireless ad hoc sensor networks
Li, X.-Y., Wan, P.-J., & Frieder, O. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1204831 · Cited by 521
Randomized incremental construction of Delaunay and Voronoi diagrams
Guibas, L. J., Knuth, D. E., & Sharir, M. (1992) · Algorithmica · doi:10.1007/bf01758770 · Cited by 479
Spectral partitioning works: planar graphs and finite element meshes
Spielman, D. A., & Teng, S.-H. (1996) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548468 · Cited by 393
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
Aurenhammer, F., & Klein, R. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50006-1 · Cited by 392
Two algorithms for nearest-neighbor search in high dimensions
Kleinberg, J. M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258653 · Cited by 348
Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape
Liang, J., Edelsbrunner, H., Fu, P., Sudhakar, P. V., & Subramaniam, S. (1998) · Proteins: Structure, Function, and Genetics · doi:10.1002/(sici)1097-0134(19981001)33:1<1::aid-prot1>3.0.co;2-o · Cited by 319
Self-citationNew applications of random sampling in computational geometry
Clarkson, K. L. (1987) · Discrete & Computational Geometry · doi:10.1007/bf02187879 · Cited by 317
A simple algorithm for nearest neighbor search in high dimensions
Nene, S. A., & Nayar, S. K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.615448 · Cited by 311
Incremental topological flipping works for regular triangulations
Edelsbrunner, H., & Shah, N. R. (1996) · Algorithmica · doi:10.1007/bf01975867 · Cited by 303
Self-citationRobust hybrid control for autonomous vehicle motion planning
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187) · doi:10.1109/cdc.2000.912871 · Cited by 297
Automatic reconstruction of surfaces and scalar fields from 3D scans
Bajaj, C. L., Bernardini, F., & Xu, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218424 · Cited by 292
Topologically sweeping an arrangement
Edelsbrunner, H., & Guibas, L. J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12171 · Cited by 283
Self-citationLiang, J., & Dill, K. A. (2001) · Biophysical Journal · doi:10.1016/s0006-3495(01)75739-6 · Cited by 273
Cutting hyperplanes for divide-and-conquer
Chazelle, B. (1993) · Discrete & Computational Geometry · doi:10.1007/bf02189314 · Cited by 270
Set Membership identification of nonlinear systems
Milanese, M., & Novara, C. (2004) · Automatica · doi:10.1016/j.automatica.2004.02.002 · Cited by 266
Computing depth contours of bivariate point clouds
Ruts, I., & Rousseeuw, P. J. (1996) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(96)00027-8 · Cited by 263
Topological models for boundary representation: a comparison with n- generalized maps
Lienhardt, P. (1991) · Computer-Aided Design · doi:10.1016/0010-4485(91)90082-8 · Cited by 259
Efficient algorithms for geometric optimization
Agarwal, P. K., & Sharir, M. (1998) · ACM Computing Surveys · doi:10.1145/299917.299918 · Cited by 257
Risk bounds for statistical learning
Massart, P., & Nédélec, É. (2006) · The Annals of Statistics · doi:10.1214/009053606000000786 · Cited by 253
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
Self-citationGeometric measures of data depth
Aloupis, G. (2006) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/072/10 · Cited by 50
Metadata
- Authors
- Goodman, J. E., & Edelsbrunner, H.
- Venue
- The American Mathematical Monthly
- Publisher
- JSTOR
- Published
- 1989-05
- Volume
- 96
- Issue
- 5
- Pages
- 457
- ISSN
- 0002-9890 (ISSN-L)
- OpenAlex
- W2022266599
- Cited by
- 1,788
- References
- 0
- FWCI
- 105.65
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.