Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Franz Aurenhammer"'
Publikováno v:
Algorithms, Vol 15, Iss 7, p 225 (2022)
We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is
Externí odkaz:
https://doaj.org/article/039a73d3bb93417db1ed75a445c575f9
Publikováno v:
International Journal of Computational Geometry & Applications. 30:235-256
The offsetting process that defines straight skeletons of polygons is generalized to arc polygons, i.e., to planar shapes with piecewise circular boundaries. The offsets are obtained by shrinking or expanding the circular arcs on the boundary in a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ebc8f5fc66fda8792ad5ef1ab901579
https://doi.org/10.1142/s0218195921500023
https://doi.org/10.1142/s0218195921500023
Publikováno v:
Computational Geometry. 84:3-11
Deciding two-guard walkability of an n-sided polygon is a well-understood problem. We study the following more general question: How far can two guards reach from a given source vertex while staying mutually visible, in the (more realistic) case that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bc05d5ea08eb233fb46cd9ec5072a2d
https://doi.org/10.1016/j.comgeo.2019.07.002
https://doi.org/10.1016/j.comgeo.2019.07.002
Autor:
Katerina Cech Dobiásová, Oswin Aichholzer, Wolfgang Aigner, Günter Rote, Franz Aurenhammer, Bert Jüttler
Publikováno v:
Journal of Graph Algorithms and Applications. 19:43-65
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1aa36c25e8936453ee20b6d8da07edde
https://doi.org/10.7155/jgaa.00346
https://doi.org/10.7155/jgaa.00346
Autor:
Pavel Valtr, Birgit Vogtenhuber, Oswin Aichholzer, Ferran Hurtado, Franz Aurenhammer, Alexander Pilz, Jorge Urrutia, Pedro Ramos, Thomas Hackl
Publikováno v:
Computational Geometry. 47:809-832
We extend the (recently introduced) notion of k-convexity of a two-dimensional subset of the Euclidean plane to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::922fa6cd47633b72ef2df91408dc80b4
https://doi.org/10.1016/j.comgeo.2014.04.004
https://doi.org/10.1016/j.comgeo.2014.04.004
Publikováno v:
Discrete Applied Mathematics. 174:52-56
We consider a variant of visibility-constrained Voronoi diagrams for n given point sites in the Euclidean plane. Whereas such diagrams typically are of size Ω ( n 2 ) , the combinatorial and algorithmic complexity of the studied variant is significa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ce784a42dfb6d8fc265f7aa783c759c
https://doi.org/10.1016/j.dam.2014.04.009
https://doi.org/10.1016/j.dam.2014.04.009
Autor:
Franz Aurenhammer, Bert Jüttler
Publikováno v:
Mathematics in Computer Science. 6:261-266
We utilize support functions to transform the problem of constructing the convex hull of a finite set of curved objects into the problem of computing the upper envelope of piecewise linear functions. This approach is particularly suited if the object
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0685bd0974e929106661989e850efcc
https://doi.org/10.1007/s11786-012-0111-z
https://doi.org/10.1007/s11786-012-0111-z
Autor:
Franz Aurenhammer, Pedro Ramos, Oswin Aichholzer, Ferran Hurtado, Jorge Urrutia, Erik D. Demaine
Publikováno v:
arXiv
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7e6a150dff9696e41a684ce46fb324c
Autor:
Gernot Walzl, Franz Aurenhammer
Publikováno v:
Discrete & Computational Geometry
We give a concise definition of mitered offset surfaces for nonconvex polytopes in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27399f93d27244b7b5bec112ddc884b3
https://pubmed.ncbi.nlm.nih.gov/32355389
https://pubmed.ncbi.nlm.nih.gov/32355389
Publikováno v:
International Journal of Computational Geometry & Applications. 21:47-69
Boundary approximation of planar shapes by circular arcs has quantitative and qualitative advantages compared to using straight-line segments. We demonstrate this by way of three basic and frequent computations on shapes – convex hull, decompositio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00505817bb1dacd71481e54310236aba
https://doi.org/10.1142/s0218195911003548
https://doi.org/10.1142/s0218195911003548