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

DOI10.1016/J.COMGEO.2019.01.004OpenAlexW2912687987WikidataQ128456776 ScholiaQ128456776MaRDI QIDQ670709FDOQ670709

Authors: F. Betul Atalay, David M. Mount 

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

• Title not available (Why is that?)
• A dynamic data structure for approximate range searching
• Geometric approximation algorithms
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• 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
• Title not available (Why is that?)
• Right-triangulated irregular networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670709)