Fast neighborhood search on polygonal meshes

L. Rocca, N. De Giorgis, D. Panozzo, E. Puppo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 methodwith respect to known techniques.

Original languageEnglish (US)
Title of host publicationEurographics Italian Chapter Conference 2011
Pages15-21
Number of pages7
DOIs
StatePublished - 2011
Event9th Eurographics Italian Chapter Conference 2011 - Salerno, Italy
Duration: Nov 24 2011Nov 25 2011

Publication series

NameEurographics Italian Chapter Conference 2011

Other

Other9th Eurographics Italian Chapter Conference 2011
CountryItaly
CitySalerno
Period11/24/1111/25/11

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Fast neighborhood search on polygonal meshes'. Together they form a unique fingerprint.

Cite this