Fast Neighborhood Search on Polygonal Meshes
No Thumbnail Available
Date
2011
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
We introduce a spatial index to support the fast retrieval of large neighborhoods of points on a polygonal mesh. Our spatial index can be computed efficiently off-line, introducing a negligible overhead over a standard indexed data structure. In retrieving neighborhoods of points on-line, we achieve a speed-up of about one order of magnitude with respect to standard topological traversal, while obtaining much more accurate results than straight 3D range search. We provide quantitative comparisons of results obtained with our method with respect to known techniques.
Description
@inproceedings{10.2312:LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021,
booktitle = {Eurographics Italian Chapter Conference 2011},
editor = {Andrea F. Abate and Michele Nappi and Genny Tortora},
title = {{Fast Neighborhood Search on Polygonal Meshes}},
author = {Rocca, Luigi and Giorgis, Nikolas De and Panozzo, Daniele and Puppo, Enrico},
year = {2011},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-88-3},
DOI = {10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2011/015-021}
}