Kinetic mesh refinement in 2D

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 341-350

  Acar, Umut A ^a   Hudson, Benoît ^b   Türkoǧlu, Duru ^c  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b AUTODESK RESEARCH   (United States)

^c THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Deformable spanners; Kinetic data structures; Mesh refinement; Self adjusting computation; Well spaced point sets

Indexed keywords

DEFORMABLE SPANNERS; KINETIC DATA STRUCTURES; MESH REFINEMENT; SELF-ADJUSTING COMPUTATION; WELL-SPACED POINT SETS;

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; OPTIMIZATION;

KINETICS;

EID: 79960167232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998254     Document Type: Conference Paper

References (23)

1. U. A. Acar, G. E. Blelloch, M. Blume, R. Harper, and K. Tangwongsan. An experimental analysis of self-adjusting computation. ACM Trans. Prog. Lang. Sys., 32(1):3:1-3:53, 2009.
2. U. A. Acar, G. E. Blelloch, R. Ley-Wild, K. Tangwongsan, and D. Türkoǧlu. Traceable data types for self-adjusting computation. In Programming Language Design and Implementation, 2010.
3. U. A. Acar, G. E. Blelloch, K. Tangwongsan, and D. Türkoǧlu. Robust kinetic convex hulls in 3D. In European Symposium on Algorithms, September 2008.
4. U. A. Acar, A. Cotter, B. Hudson, and D. Türkoǧlu. Dynamic well-spaced point sets. In Symposium on Computational Geometry, 2010.
5. U. A. Acar, B. Hudson, G. L. Miller, and T. Phillips. SVR: Practical engineering of a fast 3d meshing algorithm. Oct 2007. Proceedings of the Sixteenth International Meshing Roundtable (IMR).
6. P. K. Agarwal, J. Gao, L. J. Guibas, H. Kaplan, V. Koltun, N. Rubin, and M. Sharir. Kinetic stable delaunay graphs. In Symposium on Computational Geometry, 2010.
7. P. K. Agarwal, Y. Wang, and H. Yu. A two-dimensional kinetic triangulation with near-quadratic topological changes. Discrete & Computational Geometry, 36(4):573-592, 2006. (Pubitemid 44631971)
8. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. Journal of Algorithms, 31(1):1-28, 1999. (Pubitemid 129609596)
9. M. Bern, D. Eppstein, and J. R. Gilbert. Provably Good Mesh Generation. Journal of Computer and System Sciences, 48(3):384-409, 1994. (Pubitemid 124013297)
10. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S.-H. Teng. Sliver Exudation. Journal of the ACM, 47(5):883-904, 2000.
11. T. K. Dey. Curve and Surface Reconstruction. Cambridge Univ. Press, 2006.
12. H. Edelsbrunner. Triangulations and meshes in computational geometry. Acta Numerica, 9:133-213, 2000.
13. J.-J. Fu and R. C. T. Lee. Voronoi diagrams of moving points in the plane. In FST and TC 10: 10th Conf. on Found. of soft. tech. and Theor. comp. sci., pages 238-254, New York, NY, USA, 1990.
14. J. Gao, L. J. Guibas, and A. Nguyen. Deformable spanners and applications. Computational Geometry: Theory and Applications, 35(1):2-19, 2006.
15. L. J. Guibas. Kinetic data structures: a state of the art report. In Workshop on algo. found. of robotics, pages 191-209, Natick, MA, USA, 1998. A. K. Peters, Ltd.
16. L. J. Guibas, J. S. B. Mitchell, and T. Roos. Voronoi diagrams of moving points in the plane. In 17th Intl. Workshop Graph-Theoretic Concepts Computer Science, pages 113-209. Springer-Verlag, Inc., 1992.
17. M. A. Hammer, U. A. Acar, and Y. Chen. CEAL: a C-based language for self-adjusting computation. In Programming Language Design and Imp., June 2009.
18. B. Hudson, G. L. Miller, and T. Phillips. Sparse Voronoi Refinement. In 15th International Meshing Roundtable, pages 339-356, 2006.
19. B. Hudson, G. L. Miller, T. Phillips, and D. R. Sheehy. Size complexity of volume meshes vs. surface meshes. In Symposium on Discrete Algorithms, 2009.
20. H. Kaplan, N. Rubin, and M. Sharir. A kinetic triangulation scheme for moving points in the plane. In Symposium on Computational Geometry, 2010.
21. R. Ley-Wild, U. A. Acar, and M. Fluet. A cost semantics for self-adjusting computation. In Principles of Programming Languages, 2009.
22. J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-585, 1995.
23. D. Talmor. Well-Spaced Points for Numerical Methods. PhD thesis, Carnegie Mellon University, August 1997.