License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2018.30
URN: urn:nbn:de:0030-drops-87438
Go to the corresponding LIPIcs Volume Portal

Devillers, Olivier ; Lazard, Sylvain ; Lenhart, William J.

3D Snap Rounding

LIPIcs-SoCG-2018-30.pdf (0.8 MB)


Let P be a set of n polygons in R^3, each of constant complexity and with pairwise disjoint interiors. We propose a rounding algorithm that maps P to a simplicial complex Q whose vertices have integer coordinates. Every face of P is mapped to a set of faces (or edges or vertices) of Q and the mapping from P to Q can be done through a continuous motion of the faces such that (i) the L_infty Hausdorff distance between a face and its image during the motion is at most 3/2 and (ii) if two points become equal during the motion, they remain equal through the rest of the motion. In the worst case, the size of Q is O(n^{15}) and the time complexity of the algorithm is O(n^{19}) but, under reasonable hypotheses, these complexities decrease to O(n^{5}) and O(n^{6}sqrt{n}).

BibTeX - Entry

  author =	{Olivier Devillers and Sylvain Lazard and William J. Lenhart},
  title =	{{3D Snap Rounding}},
  booktitle =	{34th International Symposium on Computational Geometry (SoCG 2018)},
  pages =	{30:1--30:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-066-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{99},
  editor =	{Bettina Speckmann and Csaba D. T{\'o}th},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-87438},
  doi =		{10.4230/LIPIcs.SoCG.2018.30},
  annote =	{Keywords: Geometric algorithms, Robustness, Fixed-precision computations}

Keywords: Geometric algorithms, Robustness, Fixed-precision computations
Collection: 34th International Symposium on Computational Geometry (SoCG 2018)
Issue Date: 2018
Date of publication: 08.06.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI