The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Handbook of discrete and computational geometry
Open accessOverview
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
Cites
Nearest Neighbors in High-Dimensional Spaces
Indyk, P. (2004) · Discrete Mathematics and Its Applications · doi:10.1201/9781420035315.ch39 · Cited by 207
Cited by
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
“, [5, 27, 25, 29, 22, 28, 17, 13, 32, 1], see also [36, 24]).”
BackgroundReal-Time Motion Planning With Applications to Autonomous Urban Driving
Kuwata, Y., Karaman, S., Teo, J., Frazzoli, E., How, J. P., & Fiore, G. (2009) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2008.2012116 · Cited by 889
A survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864
Semi-Supervised Hashing for Large-Scale Search
Wang, J., Kumar, S., & Chang, S.-F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.48 · Cited by 810
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
Model predictive control based on linear programming - the explicit solution
Bemporad, A., Borrelli, F., & Morari, M. (2002) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2002.805688 · Cited by 756
A Theory of Network Localization
Aspnes, J., Eren, T., Goldenberg, D. K., Morse, A. S., Whiteley, W., Yang, Y. R., Anderson, B. D. O., & Belhumeur, P. N. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.174 · Cited by 635
The Coverage Problem in a Wireless Sensor Network
Huang, C.-F., & Tseng, Y.-C. (2005) · Mobile Networks and Applications · doi:10.1007/s11036-005-1564-y · Cited by 588
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists
Chazal, F., & Michel, B. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.667963 · Cited by 581
A survey on coverage and connectivity issues in wireless sensor networks
Zhu, C., Zheng, C., Shu, L., & Han, G. (2012) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2011.11.016 · Cited by 562
A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
Kloetzer, M., & Belta, C. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.914952 · Cited by 514
FakeCatcher: Detection of Synthetic Portrait Videos using Biological Signals
Ciftci, U. A., Demir, I., & Yin, L. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3009287 · Cited by 499
Navigation Strategies for Exploring Indoor Environments
Gonzalez-Banos, H. H., & Latombe, J.-C. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402128964099 · Cited by 481
Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing
Elmoataz, A., Lezoray, O., & Bougleux, S. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.924284 · Cited by 466
Geometrically Constrained Trajectory Optimization for Multicopters
Wang, Z., Zhou, X., Xu, C., & Gao, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3160022 · Cited by 434
Geometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
Visibility-based probabilistic roadmaps for motion planning
Siméon, T., Laumond, J.-P., & Nissoux, C. (2000) · Advanced Robotics · doi:10.1163/156855300741960 · Cited by 329
Effective lattice point counting in rational convex polytopes
De Loera, J. A., Hemmecke, R., Tauzer, J., & Yoshida, R. (2004) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2003.04.003 · Cited by 261
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Hsu, D., Latombe, J.-C., & Kurniawati, H. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906067174 · Cited by 260
Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web
van de Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B. J. T., Pranav, P., Park, C., Hellwing, W. A., Eldering, B., Kruithof, N., Bos, E. G. P., et al. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25249-5_3 · Cited by 84
Approximate convex decomposition for 3D meshes with collision-aware concavity and tree search
Wei, X., Liu, M., Ling, Z., & Su, H. (2022) · ACM Transactions on Graphics · doi:10.1145/3528223.3530103 · Cited by 80
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 1998-06-01
- Volume
- 35
- Issue
- 10
- Pages
- 35-5707b-35-5707b
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W4252017042
- Cited by
- 1,456
- References
- 1
- Type
- book review
- Language
- en
- Open access
- gold
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.