License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2012.498
URN: urn:nbn:de:0030-drops-38845
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3884/
Ahn, Hee-Kap ;
Cheng, Siu-Wing ;
Kweon, Hyuk Jun ;
Yon, Juyoung
Overlap of Convex Polytopes under Rigid Motion
Abstract
We present an algorithm to compute an approximate overlap of two convex polytopes P_1 and P_2 in R^3 under rigid motion. Given any
epsilon in (0,1/2], our algorithm runs in O(epsilon^{-3}n log^{3.5}n) time with probability 1 - n^{-O(1)} and returns a (1-epsilon)-approximate maximum overlap, provided that the maximum overlap is at least lambda max(|P_1|,|P_2|) for some given constant lambda in (0,1].
BibTeX - Entry
@InProceedings{ahn_et_al:LIPIcs:2012:3884,
author = {Hee-Kap Ahn and Siu-Wing Cheng and Hyuk Jun Kweon and Juyoung Yon},
title = {{Overlap of Convex Polytopes under Rigid Motion}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) },
pages = {498--509},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-47-7},
ISSN = {1868-8969},
year = {2012},
volume = {18},
editor = {Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2012/3884},
URN = {urn:nbn:de:0030-drops-38845},
doi = {10.4230/LIPIcs.FSTTCS.2012.498},
annote = {Keywords: convex polytope, overlap, approximation, rigid motion}
}
|
Keywords: |
|
convex polytope, overlap, approximation, rigid motion |
|
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) |
|
Issue Date: |
|
2012 |
|
Date of publication: |
|
14.12.2012 |
