Title: Trixel Buffer Logic for I/O Bound Point in N-Polygon Inclusion Tests of Massive Bathymetric Data
Authors: Oliveira, João Fradinho
Ziebart, Marek
Iliffe, Jonathan
Turner, James
Robson, Stuart
Citation: Journal of WSCG. 2013, vol. 21, no. 1, p. 79-88.
Issue Date: 2013
Publisher: Václav Skala - Union Agency
Document type: článek
URI: http://wscg.zcu.cz/WSCG2013/!_2013_J_WSCG-1.pdf
ISSN: 1213–6972 (hardcopy)
1213-6980 (CD-ROM)
1213–6964 (on-line)
Keywords: prostorová data;zpracování obrazu;batymerická data;vykreslování;trixel buffery
Keywords in different language: spatial data;image processing;bathymeric data;rendering;trixel buffers
Abstract: “Trixel Buffers is a new spatial data-structure for fast point in multiple polygon inclusion queries. The algorithm utilizes a pre-processing step in which the inside/outside status of a quadtree´s leaf triangles without polygon geometry is pre-computed automatically; at run-time point queries lying within these triangles simply inherit their inclusion status. If a point query lies in a leaf triangle enclosing polygon vertices or crossing edges, a ray is fired from the point towards the triangle center whose polygon inclusion properties has also been pre-computed: rules are then applied to the intersection count and center-point properties to infer the polygon inclusion status. Our main contribution is that rays need not be followed until the polygon limits, and consequently the algorithm is I/O bound with shallow trees. It took 1h36m rather than days of using a standard ray test to determine the multiple polygon (~270,000 line segments) inclusion of 1.75 billion points on a 2.5GHz DuoCore computer.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 21, Number 1 (2013)

Files in This Item:
File Description SizeFormat 
Oliviera.pdfPlný text3,7 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6872

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.