Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions

DOI10.1016/j.comgeo.2019.01.004OpenAlexW2912687987WikidataQ128456776 ScholiaQ128456776MaRDI QIDQ670709

David M. Mount, F. Betul Atalay

Publication date: 20 March 2019

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2019.01.004

zbMATH Keywords

compatible mesheshierarchical simplicial meshes

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Amortized analysis of smooth quadtrees in all dimensions
• Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes
• POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• A dynamic data structure for approximate range searching
• Right-triangulated irregular networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions