Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Thomas C. Shermer"'
Publikováno v:
Theory of Computing Systems. 64:1292-1306
Two points p and q in a simple polygon P are k-visible when the line segment pq crosses the boundary of P at most k times. Given a query point q, a positive integer k, and a polygon P, we design an algorithm that computes the region of P that is k-vi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::696fbd2433b3791b6bcbbffbbc8e4e3a
https://doi.org/10.1007/s00224-020-09999-0
https://doi.org/10.1007/s00224-020-09999-0
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031066771
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe1f0b3671d965730fb1d3d9df0bdec6
https://doi.org/10.1007/978-3-031-06678-8_15
https://doi.org/10.1007/978-3-031-06678-8_15
Publikováno v:
Computational Geometry. 98:101774
Given a simple polygon P on n vertices, n r of which are reflex, and a set D of m pairwise intersecting geodesic disks in P, we show that at most 14 points in P suffice to pierce all the disks in D and these points can be computed in O ( n + m log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd7deb329e6f636c5016f7946a1c0c57
https://doi.org/10.1016/j.comgeo.2021.101774
https://doi.org/10.1016/j.comgeo.2021.101774
Autor:
Prosenjit Bose, Thomas C. Shermer
Publikováno v:
Computational Geometry. 96:101748
Beacon attraction, or simply attraction, is a movement system whereby a point moves in a free space so as to always locally minimize its Euclidean distance to an activated beacon (also a point). This results in the point moving directly towards the b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62bb34f40b4a1d9fe21a85d3729c32b2
https://doi.org/10.1016/j.comgeo.2021.101748
https://doi.org/10.1016/j.comgeo.2021.101748
Autor:
Thomas C. Shermer, Prosenjit Bose
We consider a repulsion actuator located in an n-sided convex environment full of point particles. When the actuator is activated, all the particles move away from the actuator. We study the problem of gathering all the particles to a point. We give
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d87b47d9476c37644f0e0d214ce744e
Publikováno v:
Networks. 57:157-168
We study nonadaptive broadcasting in trees, a process of sending a message from one vertex in a tree to all other vertices. In the nonadaptive model, each vertex has a specified, ordered list of its neighbors. After receiving a broadcast message, a v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc8d953f45a3142b9526fd124ef03a1f
https://doi.org/10.1002/net.20396
https://doi.org/10.1002/net.20396
Publikováno v:
Discrete Mathematics. 309:2239-2249
A spanning subgraph S=(V,E^') of a connected graph G=(V,E) is an (x+c)-spanner if for any pair of vertices u and v, d"S(u,v)@?d"G(u,v)+c where d"G and d"S are the usual distance functions in G and S, respectively. The parameter c is called the delay
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29e451017b3caa12a0e8c1800afbb1d0
https://doi.org/10.1016/j.disc.2008.04.063
https://doi.org/10.1016/j.disc.2008.04.063
Publikováno v:
Journal of Discrete Algorithms. 5(3):524-532
In this paper, we present an algorithm for computing the maximum clique in the visibility graph G of a simple polygon P in O(n2e) time, where n and e are number of vertices and edges of G respectively. We also present an O(ne) time algorithm for comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf63ea054ce40387b5cb15cc72fdb26b
Publikováno v:
Computational Geometry. 33:165-173
In this paper, we present a linear time algorithm to remove winding of a simple polygon P with respect to a given point q inside P. The algorithm removes winding by locating a subset of Jordan sequence that is in the proper order and uses only one st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e296e8cb54c0edba576ed987a0b00f0
https://doi.org/10.1016/j.comgeo.2005.05.001
https://doi.org/10.1016/j.comgeo.2005.05.001
Publikováno v:
Discrete Mathematics. 296:167-186
A spanning subgraph S=(V,E′) of a connected graph G=(V,E) is an (x+c)-spanner if for any pair of vertices u and v, dS(u,v)⩽dG(u,v)+c where dG and dS are the usual distance functions in G and S, respectively. The parameter c is called the delay of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c08421cb52a8f343157abd2de38fcae
https://doi.org/10.1016/j.disc.2005.04.004
https://doi.org/10.1016/j.disc.2005.04.004