Presentation 2010-10-15
Constant-Work-Space Algorithms for Geometric Problems (1)
Tetsuo ASANO, Wolfgang MULZER, Gunter ROTE, Yajun WANG,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We present space-efficient algorithms for geometric problems in a restricted computational model called "constant work space" or "log-space" computation. We start with an algorithm for drawing a Delaunay triangulation of a planar point set and then extend it to another algorithm for drawing a Voronoi diagram. There are Θ(n log n)-time algorithms for those problems in a standard computational model for n points. Our algorithms run in O(n^2) time using only a constant number of storage cells of O(log n) bits in total. Then, we give a cubic-time algorithm for computing a Euclidean minimum spanning tree for a point set.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) constant-work-space algorithm / geometric problem / Delaunay triangulation / Voronoi diagram / Euclidean minimum spanning tree
Paper # COMP2010-31
Date of Issue

Conference Information
Committee COMP
Conference Date 2010/10/8(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Constant-Work-Space Algorithms for Geometric Problems (1)
Sub Title (in English)
Keyword(1) constant-work-space algorithm
Keyword(2) geometric problem
Keyword(3) Delaunay triangulation
Keyword(4) Voronoi diagram
Keyword(5) Euclidean minimum spanning tree
1st Author's Name Tetsuo ASANO
1st Author's Affiliation Graduate School of Information Sciences, JAIST()
2nd Author's Name Wolfgang MULZER
2nd Author's Affiliation Department of Computer Science, Princeton University
3rd Author's Name Gunter ROTE
3rd Author's Affiliation Institut fur Infomatik, Freie Universitat Berlin
4th Author's Name Yajun WANG
4th Author's Affiliation Theory Group, Microsoft Research Asia
Date 2010-10-15
Paper # COMP2010-31
Volume (vol) vol.110
Number (no) 232
Page pp.pp.-
#Pages 7
Date of Issue