Delaunay triangulation of imprecise points simplified and extended

K. Buchin, M. Löffler, P. Morin, W. Mulzer

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

Samenvatting

Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collection R of input regions known in advance. Building on recent work by Löffler and Snoeyink[21], we show how to leverage our knowledge of R for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, eg, overlapping disks of different sizes and fat regions.
Originele taal-2Engels
TitelAlgorithms and Data Structures (Proceedings 11th International Workshop, WADS 2009, Banff, Alberta, Canada, August 21-23, 2009)
RedacteurenF. Dehne, M. Gavrilova, J.-R. Sack, C.D. Tóth
Plaats van productieBerlin
UitgeverijSpringer
Pagina's131-143
ISBN van geprinte versie978-3-642-03366-7
DOI's
StatusGepubliceerd - 2009

Publicatie series

NaamLecture Notes in Computer Science
Volume5664
ISSN van geprinte versie0302-9743

Vingerafdruk Duik in de onderzoeksthema's van 'Delaunay triangulation of imprecise points simplified and extended'. Samen vormen ze een unieke vingerafdruk.

Citeer dit