Computational geometry in C
The DOI matches its Crossref record.
Abstract
The first edition of this book is recognised as one of the definitive sources on the subject of Computational Geometry. In fact, O'Rourke has a long history in the field, has published many papers on the subject and is responsible for the computer graphics algorithms newsgroup which is where all computer geometers meet to discuss their ideas and problems. Typical problems discussed include how a polygon can be represented, how to calculate its area, how to detect if two polygons intersect and how to calculate the convex hull of a polygon. This leads onto more complex issues such as motion planning and seeing if a robot is able navigate from point x to point y without bumping into objects. The algorithms for these (and other) problems are discussed and many are implemented. In addition, many of the ideas are also discussed from the point of view of three and more dimensions. The only disappointment is that many problems are posed as questions at the end of the chapters and, as far as I could see, you cannot get the answers in the forms of a lecturer's supplement. This is fine in academia but not a lot of use for the commercial world. Due to the range of problems that incorporate computational geometry this book cannot be expected to answer every problem you might have. You will undoubtedly need access to other textbooks but I have been using the first edition of this book for many years and the second edition is a welcome addition to my bookshelf. If I was only allowed one computational geometry book then it would undoubtedly be this one.
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
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
Efficient collision detection using bounding volume hierarchies of k-DOPs
Klosowski, J. T., Held, M., Mitchell, J. S. B., Sowizral, H., & Zikan, K. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.675649 · Cited by 873
The Dangers of Extreme Counterfactuals
King, G., & Zeng, L. (2006) · Political Analysis · doi:10.1093/pan/mpj004 · Cited by 540
Interactive motion generation from examples
Arikan, O., & Forsyth, D. A. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566606 · Cited by 539
Burgman, M. A., & Fox, J. C. (2003) · Animal Conservation · doi:10.1017/s1367943003003044 · Cited by 538
Wu, J., & David, J. L. (2002) · Ecological Modelling · doi:10.1016/s0304-3800(01)00499-9 · Cited by 496
Immersed boundary technique for turbulent flow simulations
Iaccarino, G., & Verzicco, R. (2003) · Applied Mechanics Reviews · doi:10.1115/1.1563627 · Cited by 410
The point in polygon problem for arbitrary polygons
Hormann, K., & Agathos, A. (2001) · Computational Geometry · doi:10.1016/s0925-7721(01)00012-8 · Cited by 397
Protecting Locations with Differential Privacy under Temporal Correlations
Xiao, Y., & Xiong, L. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813640 · Cited by 376
Multi-resolution contour-based fitting of macromolecular structures
Chacón, P., & Wriggers, W. (2002) · Journal of Molecular Biology · doi:10.1006/jmbi.2002.5438 · Cited by 336
A fully automatic and robust brain MRI tissue classification method
Cocosco, C. A., Zijdenbos, A. P., & Evans, A. C. (2003) · Medical Image Analysis · doi:10.1016/s1361-8415(03)00037-9 · Cited by 328
Mystery, complexity, legibility and coherence: A meta-analysis
Stamps, A. E. (2004) · Journal of Environmental Psychology · doi:10.1016/s0272-4944(03)00023-9 · Cited by 284
Liang, J., & Dill, K. A. (2001) · Biophysical Journal · doi:10.1016/s0006-3495(01)75739-6 · Cited by 273
Slime mould computes planar shapes
Adamatzky, A. (2012) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2012.047239 · Cited by 31
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 1999-07-01
- Volume
- 36
- Issue
- 11
- Pages
- 36-6329-36-6329
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2982209274
- Cited by
- 775
- References
- 0
- Type
- book review
- 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.