Zobrazeno 1 - 10
of 871
pro vyhledávání: '"Polygon covering"'
Autor:
Süleyman Eken, Ahmet Sayar
Publikováno v:
Tehnički Vjesnik, Vol 26, Iss 1, Pp 36-42 (2019)
The polygon covering problem is an important class of problems in the area of computational geometry. There are slightly different versions of this problem depending on the types of polygons to be addressed. In this paper, we focus on finding an answ
Externí odkaz:
https://doaj.org/article/3bed916ee4e84d5e8215ddb95bef53d1
Publikováno v:
Theoretical Computer Science. 815:270-288
Given a set B of d-dimensional boxes (i.e., axis-aligned hyperrectangles), a minimum coverage kernel is a subset of B of minimum size covering the same region as B . Computing it is NP -hard, but as for many similar NP -hard problems (e.g., Box Cover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11e61b0376c43f4c0c75c702b51deef6
https://doi.org/10.1016/j.tcs.2020.01.021
https://doi.org/10.1016/j.tcs.2020.01.021
Publikováno v:
Theoretical Computer Science. 815:163-181
In this paper, we consider a new variant of covering in an orthogonal art gallery problem where each guard is a sliding k-transmitter. Such a guard can travel back and forth along an orthogonal line segment, say s, inside the polygon. A point p is co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18ef6904692ad6ba14fa2327521cc633
https://doi.org/10.1016/j.tcs.2020.02.008
https://doi.org/10.1016/j.tcs.2020.02.008
Autor:
Vaclav Skala
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf77659ac98de12cb14cf75ce3c414cb
Publikováno v:
Computational Optimization and Applications. 69:383-402
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection of the elli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efd5d9b90db9fb32b606b48bd66a6588
https://doi.org/10.1007/s10589-017-9952-3
https://doi.org/10.1007/s10589-017-9952-3
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ruhuna Journal of Science, Vol 8, Iss 1, Pp 67-75 (2017)
Computing the area of an arbitrary polygon is a popular problem in pure mathematics. The two methods used are Shoelace Method (SM) and Orthogonal Trapezoids Method (OTM). In OTM, the polygon is partitioned into trapezoids by drawing either horizontal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb9c751fda9f340a4909b4ad1c9b78d1
http://rjs.ruh.ac.lk/index.php/rjs/article/view/123/171
http://rjs.ruh.ac.lk/index.php/rjs/article/view/123/171
Autor:
Chuzo Iwamoto
Publikováno v:
IEICE Transactions on Information and Systems. :1521-1525
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::845dc817db5c4dc29e9f75d875b85a58
https://doi.org/10.1587/transinf.2016edl8251
https://doi.org/10.1587/transinf.2016edl8251
Autor:
Vladimir Popov
Publikováno v:
Vestnik Volgogradskogo gosudarstvennogo universiteta. Serija 1. Mathematica. Physica. :85-96
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eec2950dd3cd28a950ff05c71cf875b6
https://doi.org/10.15688/jvolsu1.2016.5.8
https://doi.org/10.15688/jvolsu1.2016.5.8
Autor:
Volkan Isler, Pratap Tokekar
Publikováno v:
ICRA
The art gallery problem is a classical sensor placement problem that asks for the minimum number of guards required to see every point in an environment. The standard formulation does not take into account self-occlusions caused by a person or an obj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71a407b6c4a4b0632fce4eabc68b9a59
https://doi.org/10.1016/j.comgeo.2016.07.004
https://doi.org/10.1016/j.comgeo.2016.07.004
Autor:
T. S. Michael, Val Pinciu
Publikováno v:
Electronic Notes in Discrete Mathematics. 54:27-32
Let P be an orthogonal polygon with n vertices, and let V ⁎ and E ⁎ be specified sets of vertices and edges of P. We prove that P has a guard set of cardinality at most ⌊ ( n + 3 | V ⁎ | + 2 | E ⁎ | ) / 4 ⌋ that includes each vertex in V
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4447cda4c0353ab5d6fbd76f2635e10f
https://doi.org/10.1016/j.endm.2016.09.006
https://doi.org/10.1016/j.endm.2016.09.006