The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the shape of a set of points in the plane
Abstract
A generalization of the convex hull of a finite set of points in the plane is introduced and analyzed. This generalization leads to a family of straight-line graphs, "\alpha-shapes," which seem to capture the intuitive notions of "fine shape" and "crude shape" of point sets. It is shown that a-shapes are subgraphs of the closest point or furthest point Delaunay triangulation. Relying on this result an optimalO(n \log n)algorithm that constructs\alpha-shapes is developed.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The indicators or indices can be utilised to show the 'connectivity' of the area and the importance of each patch within the whole landscape graph.
“The indicators or indices can be utilised to show the ‘connectivity’ of the area and the importance of each patch within the whole landscape graph (Edelsbrunner, Kirkpatrick, & Seidel 1983; Radke 2015).”
From Exploratory GIS: modelling past land use and occupancy with functional connectivity, willandra lakes region world heritage area, NSW, australia (2022) · cites this paper as Edelsbrunner, Kirkpatrick, & Seidel 1983
Functional connectivity has been expressed within GIS through least-cost path modelling, graph trees, and variants of the Voronoi diagrams.
“Functional connectivity has been expressed within GIS through least-cost path modelling, graph trees, and variants of the Voronoi diagrams (Edelsbrunner, Kirkpatrick, & Seidel 1983; Gustas & Supernant 2017; Radke 2015; Thomas 2000; Toussaint 2015).”
From Exploratory GIS: modelling past land use and occupancy with functional connectivity, willandra lakes region world heritage area, NSW, australia (2022) · cites this paper as Edelsbrunner, Kirkpatrick, & Seidel 1983
Citations
Cites
Handbook of Mathematical Functions
McQuarrie, D. A. (1966) · American Journal of Physics · doi:10.1119/1.1972842 · Cited by 40,433
Flagged first, then by citations
Research works printed but not linked: 20
- jung, 1901, Ueber die kleinste Kugel, die eine raeumlich Figur einschliesst, J F Reine U Angew Math, 123, 241
- 10.1007/BF01224932 · DOI
- 10.1111/j.1538-4632.1980.tb00031.x · DOI
- mccreight, 1981, Efficient algorithms for enumerating intersecting intervals and rectangles, J Algorithms, 2, 245
- overmars, 1980, Dynamization of order decomposable set problems
- preparata, 1977, Steps into computational geometry
- seidel, 1981, A convex hull algorithm optimal for point sets in even dimensions
- 10.1109/SFCS.1975.8 · DOI
- supowit, 1980, The relative Neighborhood graph with an application to minimum spanning trees
- 10.1016/0031-3203(80)90066-7 · DOI
- dewdney, 1977, A convex partition of R<superscript>3</superscript> with applications to Crum's problem and Knuth's post office problem, Utilitas Math, 12, 193
- brown, 1980, Geometric transforms for fast geometric algorithms
- fairfield, 1979, Contoured shape generation: Forms that people see in dot patterns, Proc IEEE Conf on Cybernetics and Society, 60
- 10.1080/00207168308803365 · DOI
- 10.1016/0020-0190(72)90045-2 · DOI
- gowda, 1980, Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures, Proc Ann Allerton Conf Comm Cont and Computing, 1
- 10.1016/0020-0190(79)90074-7 · DOI
- aki, 1978, Efficient convex hull algorithms for pattern recognition applications, Proc 4th Int Joint Conf on Pattern Recognition, 483
- jarvis, 1977, Computing the shape hull of points in the plane, Proc of the IEEE Comp Soc Conf on Pattern Recognition and Image Processing, 231
- toussiant, 1980, Pattern recognition and geometrical complexity, Int Conf Pattern Recognition, 1324
Cited by
Sorted by citations
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-citationIntrinsic map dynamics exploration for uncharted effective free-energy landscapes
Chiavazzo, E., Covino, R., Coifman, R. R., Gear, C. W., Georgiou, A. S., Hummer, G., & Kevrekidis, I. G. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1621481114 · Cited by 125
Slime mould computes planar shapes
Adamatzky, A. (2012) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2012.047239 · Cited by 31
Advancing Near-Real-Time Quality Controls of Meteorological Observations
Toreti, A., Bratu, M., Müller, E., van der Grijn, G., Oliveira, I., Zampieri, M., & Ceglar, A. (2022) · Bulletin of the American Meteorological Society · doi:10.1175/bams-d-21-0171.1 · Cited by 3
Thomas, K. (2022) · Journal of Computer Applications in Archaeology · doi:10.5334/jcaa.98 · Cited by 1
Metadata
- Authors
- Edelsbrunner, H., Kirkpatrick, D., & Seidel, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1983-07
- Volume
- 29
- Issue
- 4
- Pages
- 551-559
- ISSN
- 0018-9448
- 1557-9654
- Cited by
- 1,634
- References
- 1
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
