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.ESA.2019.32
URN: urn:nbn:de:0030-drops-111538
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11153/
Chun, Jinhee ;
Kikuchi, Kenya ;
Tokuyama, Takeshi
Consistent Digital Curved Rays and Pseudoline Arrangements
Abstract
Representing a family of geometric objects in the digital world where each object is represented by a set of pixels is a basic problem in graphics and computational geometry. One important criterion is the consistency, where the intersection pattern of the objects should be consistent with axioms of the Euclidean geometry, e.g., the intersection of two lines should be a single connected component. Previously, the set of linear rays and segments has been considered. In this paper, we extended this theory to families of curved rays going through the origin. We further consider some psudoline arrangements obtained as unions of such families of rays.
BibTeX - Entry
@InProceedings{chun_et_al:LIPIcs:2019:11153,
author = {Jinhee Chun and Kenya Kikuchi and Takeshi Tokuyama},
title = {{Consistent Digital Curved Rays and Pseudoline Arrangements}},
booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)},
pages = {32:1--32:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-124-5},
ISSN = {1868-8969},
year = {2019},
volume = {144},
editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11153},
URN = {urn:nbn:de:0030-drops-111538},
doi = {10.4230/LIPIcs.ESA.2019.32},
annote = {Keywords: Computational Geometry, Digital Geometry, Spanning Tree, Graph Drawing}
}
Keywords: |
|
Computational Geometry, Digital Geometry, Spanning Tree, Graph Drawing |
Collection: |
|
27th Annual European Symposium on Algorithms (ESA 2019) |
Issue Date: |
|
2019 |
Date of publication: |
|
06.09.2019 |