Zobrazeno 1 - 10
of 953
pro vyhledávání: '"Orthogonal convex hull"'
Autor:
Sang Won Bae, Otfried Cheong, Chan-Su Shin, Dongwoo Park, Judit Abardia, Hee-Kap Ahn, Susanna Dann
Publikováno v:
Computational Geometry. 77:40-50
Given two convex d-polytopes P and Q in R d for d ⩾ 3 , we study the problem of bundling P and Q in a smallest convex container. More precisely, our problem asks to find a minimum convex set containing P and a translate of Q that do not properly ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cd4d834e9178f685a63d57ff8bfde94
https://doi.org/10.1016/j.comgeo.2018.02.004
https://doi.org/10.1016/j.comgeo.2018.02.004
Publikováno v:
Theoretical Computer Science. 718:14-23
For a set P of n points in the plane, we present algorithms for finding two bounded convex sets that cover P such that the total area or perimeter of the convex sets is minimized in O ( n 4 log n ) and O ( n 2 log n ) time, respectively. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::893345ebf011d2f8cf97f052ec8f65e5
https://doi.org/10.1016/j.tcs.2016.11.014
https://doi.org/10.1016/j.tcs.2016.11.014
Autor:
Darren Strash, Nodari Sitchinava
Publikováno v:
Journal of Graph Algorithms and Applications. 22:431-459
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two classes of un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8dde5a7aff0e2499449ae4919e91039
https://doi.org/10.7155/jgaa.00469
https://doi.org/10.7155/jgaa.00469
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theoretical Computer Science. 702:48-59
Bounding hulls such as convex hull, -shape, -hull, concave hull, crust, etc. offer a wide variety of useful applications. In this paper, we explore another bounding hull, namely -concave hull, as a generalization of convex hull. The parameter determi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afb162904aed41be94e493128c820884
https://doi.org/10.1016/j.tcs.2017.08.014
https://doi.org/10.1016/j.tcs.2017.08.014
Autor:
Sumio Yamada
Publikováno v:
Sugaku Expositions. 30:159-186
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ea4affc07450dc4bd0165370df4cf38
https://doi.org/10.1090/suga/422
https://doi.org/10.1090/suga/422
Autor:
Roland Glantz, Henning Meyerhenke
Publikováno v:
Theoretical Computer Science. 695:54-73
The general notion of convexity also applies to a graph G = ( V , E ) . A subset V c of V is called a convex set if all shortest paths with end vertices in V c remain within V c . A convex cut of G is a partition ( V 1 , V 2 ) of V such that V 1 and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2acd7da89a95feef450cf25dc0549a22
https://doi.org/10.1016/j.tcs.2017.07.026
https://doi.org/10.1016/j.tcs.2017.07.026
Publikováno v:
Discrete & Computational Geometry. 59:165-174
Choose uniform random points $$X_1, \dots , X_n$$ in a given convex set and let $${\text { conv}}[X_1, \dots , X_n]$$ be their convex hull. It is shown that in dimension three the expected volume of this convex hull is in general not monotone with re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0429d1439b237063e1b4dbf2f200a01
https://doi.org/10.1007/s00454-017-9914-7
https://doi.org/10.1007/s00454-017-9914-7
Autor:
Yi-Jun Chang, Hsu-Chun Yen
Publikováno v:
Computational Geometry. 62:34-51
We investigate the bend-minimization problem with respect to a new drawing style called an orthogonally convex drawing, which is an orthogonal drawing with an additional requirement that each inner face is drawn as an orthogonally convex polygon. For
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fb3a36e3af0d6f9060a009a94b44e4e
https://doi.org/10.1016/j.comgeo.2017.01.003
https://doi.org/10.1016/j.comgeo.2017.01.003
Publikováno v:
SIAM Review. 59:346-365
The convex hull of a set of points, $C$, serves to expose extremal properties of $C$ and can help identify elements in $C$ of high interest. For many problems, particularly in the presence of noise, the true vertex set (and facets) may be difficult t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0afa6cddc594234d038f90deaf6fcb3
https://doi.org/10.1137/15m1047921
https://doi.org/10.1137/15m1047921