MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Ray, Rahul
Smid, MIchiel
Lange, Katharina
Wendt, Ulrich		dblp
dblp
dblp
dblp
Not MPG Author(s):
Smid, MIchiel
Lange, Katharina
Wendt, Ulrich
Editor(s):
Fourey, Sébastien
Herman, Gabor T.
Kong, T. Yung		dblp
dblp
dblp
Not MPII Editor(s):
Fourey, Sébastien
Herman, Gabor T.
Kong, T. Yung
BibTeX cite key*:
Rahul2001
Title, Booktitle
Title*:
Computing Large Planar Regions in Terrains
iwcia01.ps (9917.84 KB)
Booktitle*:
IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01)
Event, URLs
Conference URL::
Downloading URL:
http://www.elsevier.nl/gej-ng/31/29/23/86/27/34/46008.pdf
Event Address*:
Philadelphia, USA
Language:
English
Event Date*
(no longer used):
-- August 23 - 24, 2001
Organization:
Event Start Date:
23 August 2001
Event End Date:
24 August 2001
Publisher
Name*:
Elsevier
URL:
http://www.elsevier.nl/locate/entcs
Address*:
Amsterdam, the Netherlands
Type:
Full Paper
Vol, No, Year, pp.
Series:
Electronic Notes in Theoretical Computer Science
Volume:
46
Number:
Month:
Pages:
139-152
Year*:
2002
VG Wort Pages:
ISBN/ISSN:
044451063X
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
We consider the problem of computing the largest region in a terrain that is approximately contained in some two-dimensional plane. We reduce this problem to the following one. Given an
embedding of a degree-3 graph G on the unit sphere S2, whose vertices are weighted, compute a connected subgraph of maximum weight that is contained in some spherical disk of a fixed
radius. We given an algorithm that solves this problem in O(n2 log n (log log n)3) time, where n denotes the number of vertices of G or, alternatively, the number of faces of the terrain. We also
give a heuristic that can be used to compute sufficiently large regions in a terrain that are approximately planar. We discuss a web-based implementation of this heuristic, and show some results
for terrains representing three-dimensional (topographical) images of fracture surfaces of metals obtained by confocal laser scanning microscopy.
URL for the Abstract:
http://www.elsevier.com/gej-ng/31/29/23/86/27/show/Products/notes/index.htt#008
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, working group publication list, CCL bibliography



BibTeX Entry:

@INPROCEEDINGS{Rahul2001,
AUTHOR = {Ray, Rahul and Smid, MIchiel and Lange, Katharina and Wendt, Ulrich},
 EDITOR = {Fourey, S{\'e}bastien and Herman, Gabor T. and Kong, T. Yung},
 TITLE = {Computing Large Planar Regions in Terrains},
 BOOKTITLE = {IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01)},
 PUBLISHER = {Elsevier},
 YEAR = {2002},
 TYPE = {Full Paper},
 VOLUME = {46},
 PAGES = {139--152},
 SERIES = {Electronic Notes in Theoretical Computer Science},
 ADDRESS = {Philadelphia, USA},
 ISBN = {044451063X},
}

Entry last modified by Christine Kiesel, 03/02/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Ray Rahul		Created
08/12/2002 17:40:47
Revisions
5.
4.
3.
2.
1.		Editor(s)
Christine Kiesel
Christine Kiesel
Anja Becker
Anja Becker
Anja Becker		Edit Dates
27.08.2003 16:23:27
27.08.2003 16:10:33
09.05.2003 14:03:02
09.05.2003 12:17:05
09.05.2003 12:01:14

File Attachment Icon
iwcia01.ps