Article

Incremental constructions con BRIO

Authors:

Günter RoteAuthors Info & Claims

SCG '03: Proceedings of the nineteenth annual symposium on Computational geometry

Pages 211 - 219

https://doi.org/10.1145/777792.777824

Published: 08 June 2003 Publication History

Abstract

Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define a biased randomized insertion order which removes enough randomness to significantly improve performance, but leaves enough randomness so that the algorithms remain theoretically optimal.

References

[1]

Agarwal, P. K., de~Berg, M., Matouaek, J., and Schwarzkopf, O. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput. 27 (1998), 654--667.

Digital Library

[2]

Arge, L. External memory data structures. In Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, and M. G. C. Resende, Eds., vol. 4 of Massive Computing. Kluwer Academic Publishers, 2002, ch. 9, pp. 313--357.

Digital Library

[3]

Asano, T., Ranjan, D., Roos, T., Welzl, E., and Widmayer, P. Space-filling curves and their use in the design of geometric data structures. Theoret. Comput. Sci. 181, 1 (July 1997), 3--15.

Digital Library

[4]

Barber, C. B., Dobkin, D. P., and Huhdanpaa, H. The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 4 (Dec. 1996), 469--483.

Digital Library

[5]

Bartholdi, III, J. J., and Platzman, L. K. A fast heuristic based on spacefilling curves for minimum-weight matching in the plane. Inform. Process. Lett. 17 (1983), 177--180.

[6]

Blelloch, G. E., Miller, G. L., Hardwick, J. C., and Talmor, D. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica 24, 3 (1999), 243--269.

[7]

Chan, T. M., Snoeyink, J., and Yap, C. K. Primal dividing and dual pruning: Output-sensitive construction of 4-d polytopes and 3-d Voronoi diagrams. Discrete Comput. Geom. 18 (1997), 433--454.

[8]

Chew, L. P. Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Dept. Math. Comput. Sci., Dartmouth College, Hanover, NH, 1986.

Digital Library

[9]

Choi, S., and Amenta, N. Delaunay triangulation programs on surface data. In Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms, January 6--8, 2002, San Francisco (2002), ACM/SIAM, pp. 135--136.

Digital Library

[10]

Cignoni, P., Montani, C. and Scopigno, R. DeWall: a fast divide and conquer Delaunay triangulation algorithm in Ed. Computer-Aided Design 30, 5 (1998), 333--341.

[11]

Clarkson, K. L. New applications of random sampling in computational geometry. Discrete Comput. Geom. 2 (1987), 195--222.

Digital Library

[12]

Clarkson, K. L., Mehlhorn, K., and Seidel, R. Four results on randomized incremental constructions. Comput. Geom. Theory Appl. 3, 4 (1993), 185--212.

Digital Library

[13]

Clarkson, K. L., and Shor, P. W. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4 (1989), 387--421.

Digital Library

[14]

de~Berg, M., van Kreveld, M., Overmars, M., and Schwarzkopf, O. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.

Digital Library

[15]

Devillers, O. The Delaunay hierarchy. Int. Journ. Found. of Comp. Sci., 13 (2002), 163--180.

[16]

Devillers, O., and Guigue, P. The shuffling buffer. Internat. J. Comput. Geom. Appl. 11 (2001), 555--572.

[17]

Dwyer, R. A. Average-case analysis of algorithms for convex hulls and Voronoi diagrams. Ph.D. thesis, Comput. Sci. Dept., Carnegie-Mellon Univ., Pittsburgh, PA, 1988. Report CMU-CS-88--132.

Digital Library

[18]

Dwyer, R. A. Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput. Geom. 6 (1991), 343--367.

Digital Library

[19]

Golin, M. J., and Na, H.-S. On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes. In Proc. 12th Annu. ACM Sympos. Comput. Geom. (2000), pp. 127--135.

[20]

Golin, M. J., and Na, H.-S. On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes. Tech. Rep. Tech. report HKUST-TCSC-2001-08, Hong Kong University of Science and Technology, 2001. http://www.cs.ust.hk/tcsc/RR/2001-08.ps.gz.

[21]

Golin, M. J., and Na, H.-S. On the proofs of two lemmas describing the intersections of spheres with the boundary of a convex polytope. Tech. Rep. Tech. report HKUST-TCSC-2001-09, Hong Kong University of Science and Technology, 2001. http://www.cs.ust.hk/tcsc/RR/2001-09.ps.gz.

[22]

Goodrich, M. T., Tsay, J.-J., Vengroff, D. E., and Vitter J. S. External-Memory Computational Geometry, In Proc. 34th Foundations of Computer Science (FOCS) (1993), pp. 714--723.

Digital Library

[23]

Mulmuley, K. A fast planar partition algorithm, I. J. Symbolic Comput. 10, 3-4 (1990), 253--280.

Digital Library

[24]

Mulmuley, K. A fast planar partition algorithm, II. J. Assoc. Comput. Mach. 38 (1991), 74--103.

Digital Library

[25]

Mulmuley, K. On levels in arrangements and Voronoi diagrams. Discrete Comput. Geom. 6 (1991), 307--338.

Digital Library

[26]

Mulmuley, K. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.

[27]

Mulmuley, K., and Schwarzkopf, O. Randomized algorithms. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, 1997, ch. 34, pp. 633--652.

Digital Library

[28]

Platzman, L. K., and Bartholdi III, J. J. Spacefilling curves and the planar travelling salesman problem. J. Assoc. Comput. Mach. 39 (1989), 719--737.

Digital Library

[29]

Sagan, H. Space-filling curves. Springer-Verlag, New York, 1994.

[30]

Seidel, R. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl. 1, 1 (1991), 51--64.

Digital Library

[31]

Seidel, R. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6 (1991), 423--434.

Digital Library

[32]

Seidel, R. Backwards analysis of randomized geometric algorithms. In New Trends in Discrete and Computational Geometry, J. Pach, Ed., vol. 10 of Algorithms and Combinatorics. Springer-Verlag, 1993, pp. 37--68.

[33]

Welzl, E. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science, H. Maurer, Ed., vol. 555 of Lecture Notes Comput. Sci. Springer-Verlag, 1991, pp. 359--370.

[34]

Zhu, B. Further computational geometry in secondary memory, In 5th Annual International Symposium on Algorithms and Computation (ISAAC) vol. 834 of Lecture Notes Comput. Sci. Springer-Verlag, 1994, pp. 514--522.

Digital Library

Cited By

Koehl PAkopyan AEdelsbrunner H(2023)Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their DerivativesJournal of Chemical Information and Modeling10.1021/acs.jcim.2c0134663:3(973-985)Online publication date: 13-Jan-2023
https://doi.org/10.1021/acs.jcim.2c01346
Alexa M(2022)α-Functions Piecewise-linear Approximation from Noisy and Hermite DataACM SIGGRAPH 2022 Conference Proceedings10.1145/3528233.3530743(1-9)Online publication date: 27-Jul-2022
https://dl.acm.org/doi/10.1145/3528233.3530743
Diazzi LAttene M(2021)Convex polyhedral meshing for robust solid modelingACM Transactions on Graphics10.1145/3478513.348056440:6(1-16)Online publication date: 10-Dec-2021
https://dl.acm.org/doi/10.1145/3478513.3480564
Show More Cited By

Index Terms

Incremental constructions con BRIO
1. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Fast segment insertion and incremental construction of constrained delaunay triangulations
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometry

The most commonly implemented method of constructing a constrained Delaunay triangulation (CDT) in the plane is to first construct a Delaunay triangulation, then incrementally insert the input segments one by one. For typical implementations of segment ...
Fast segment insertion and incremental construction of constrained Delaunay triangulations

The most commonly implemented method of constructing a constrained Delaunay triangulation (CDT) in the plane is to first construct a Delaunay triangulation, then incrementally insert the input segments one by one. For typical implementations of segment ...
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

The Hausdorff Voronoi diagram of clusters of points in the plane is a generalization of Voronoi diagrams based on the Hausdorff distance function. Its combinatorial complexity is $$O(n+m)$$O(n+m), where n is the total number of points and $$m$$m is the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SCG '03: Proceedings of the nineteenth annual symposium on Computational geometry

June 2003

398 pages

ISBN:1581136633

DOI:10.1145/777792

Conference Chair:
Steve Fortune
Bell Laboratories

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 June 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SoCG03

Sponsor:

SoCG03: Annual ACM Symposium on Computational Geometry

June 8 - 10, 2003

California, San Diego, USA

Acceptance Rates

SCG '03 Paper Acceptance Rate 42 of 118 submissions, 36%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

64
Total Citations
View Citations
469
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Koehl PAkopyan AEdelsbrunner H(2023)Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their DerivativesJournal of Chemical Information and Modeling10.1021/acs.jcim.2c0134663:3(973-985)Online publication date: 13-Jan-2023
https://doi.org/10.1021/acs.jcim.2c01346
Alexa M(2022)α-Functions Piecewise-linear Approximation from Noisy and Hermite DataACM SIGGRAPH 2022 Conference Proceedings10.1145/3528233.3530743(1-9)Online publication date: 27-Jul-2022
https://dl.acm.org/doi/10.1145/3528233.3530743
Diazzi LAttene M(2021)Convex polyhedral meshing for robust solid modelingACM Transactions on Graphics10.1145/3478513.348056440:6(1-16)Online publication date: 10-Dec-2021
https://dl.acm.org/doi/10.1145/3478513.3480564
Basselin JAlonso LRay NSokolov DLefebvre SLévy B(2021)Restricted Power Diagrams on the GPUComputer Graphics Forum10.1111/cgf.14261040:2(1-12)Online publication date: 4-Jun-2021
https://doi.org/10.1111/cgf.142610
Levy BMohayaee Rvon Hausegger S(2021)A fast semidiscrete optimal transport algorithm for a unique reconstruction of the early UniverseMonthly Notices of the Royal Astronomical Society10.1093/mnras/stab1676506:1(1165-1185)Online publication date: 16-Jun-2021
https://doi.org/10.1093/mnras/stab1676
Boissonnat JDevillers ODutta KGlisse M(2020)Randomized Incremental Construction of Delaunay Triangulations of Nice Point SetsDiscrete & Computational Geometry10.1007/s00454-020-00235-7Online publication date: 8-Sep-2020
https://doi.org/10.1007/s00454-020-00235-7
Su TWang WLiu HLiu ZLi XJia ZZhou LSong ZDing MCui A(2020)An adaptive and rapid 3D Delaunay triangulation for randomly distributed point cloud dataThe Visual Computer10.1007/s00371-020-02011-3Online publication date: 21-Nov-2020
https://doi.org/10.1007/s00371-020-02011-3
Yesil SHeidarshenas AMorrison ATorrellas JTaufer MBalaji PPeña A(2019)Understanding priority-based scheduling of graph algorithms on a shared-memory platformProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3295500.3356160(1-14)Online publication date: 17-Nov-2019
https://dl.acm.org/doi/10.1145/3295500.3356160
Liu NLin BLv GZhu AZhou L(2019)A Delaunay Triangulation Algorithm Based on Dual-Spatial Data OrganizationPFG – Journal of Photogrammetry, Remote Sensing and Geoinformation Science10.1007/s41064-019-00067-yOnline publication date: 9-May-2019
https://doi.org/10.1007/s41064-019-00067-y
Drakopoulos FTsolakis CChrisochoides N(2018)Fine-grained Speculative Topological Transformation Scheme for Local Reconnection Methods2018 Aviation Technology, Integration, and Operations Conference10.2514/6.2018-2889Online publication date: 24-Jun-2018
https://doi.org/10.2514/6.2018-2889
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents