Quadtree- and octree-based approach for point data selection in 2D or 3D
Stefan Peters
Abstract
Open-access reader
Stefan Peters
Abstract
Open-access reader
This article describes a new automatic quadtree-/octree-based and scale-dependent generalization algorithm for point selection. The benefit toward existing point selection methods is that it preserves global as well as local characteristics of the spatial point distribution and of the spatial point density. It can be applied not only to points in 2D space but also to points in 3D space. In this article, an evaluation of the new point selection method is also provided.
OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article describes a new automatic quadtree-/octree-based and scale-dependent generalization algorithm for point selection. The benefit toward existing point selection methods is that it preserves global as well as local characteristics of the spatial point distribution and of the spatial point density. It can be applied not only to points in 2D space but also to points in 3D space. In this article, an evaluation of the new point selection method is also provided.
Key concepts: Octree, Quadtree, Point (geometry), Selection (genetic algorithm), Generalization, Computer science, Point distribution model, Space (punctuation)