-
1
-
-
85037446260
-
-
Technical Report TR89-7, Bulgarian Academy of Sciences; also Technical Report SCS-TR-163, School of Computer Science, Carleton University
-
L. Aleksandrov, H. Djidjev, and J.-R. Sack, Finding a central link segment of a simple polygon in O(n log n) time, Technical Report TR89-7, Bulgarian Academy of Sciences; also Technical Report SCS-TR-163, School of Computer Science, Carleton University, 1989.
-
(1989)
Finding a Central Link Segment of a Simple Polygon in O(n Log n) Time
-
-
Aleksandrov, L.1
Djidjev, H.2
Sack, J.-R.3
-
2
-
-
0019683897
-
An optimal algorithm for determining the visibility polygon from an edge
-
D. Avis and G. Toussaint, An optimal algorithm for determining the visibility polygon from an edge, IEEE Transactions on Computers, C-30, pp. 910-914, 1981.
-
(1981)
IEEE Transactions on Computers
, vol.C-30
, pp. 910-914
-
-
Avis, D.1
Toussaint, G.2
-
3
-
-
21844516262
-
Logarithmic-time link path queries in a simple polygon
-
E. M. Arkin, J. S. B. Mitchell, and S. Suri. Logarithmic-time link path queries in a simple polygon. Internat. J. Comput. Geom. Appl., 5(4):369-395, 1995.
-
(1995)
Internat. J. Comput. Geom. Appl.
, vol.5
, Issue.4
, pp. 369-395
-
-
Arkin, E.M.1
Mitchell, J.S.B.2
Suri, S.3
-
5
-
-
0028092565
-
Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon
-
G. Das and G. Narasimhan, Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon, Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994.
-
(1994)
Proc. 10th Annu. ACM Sympos. Comput. Geom.
-
-
Das, G.1
Narasimhan, G.2
-
6
-
-
0012916872
-
An O(n log n) algorithm for computing the link center of a simple polygon
-
H. Djidjev, A. Lingas and J.-R. Sack, An O(n log n) algorithm for computing the link center of a simple polygon, Discrete and Computational Geometry, 8, pp. 131-152, 1992.
-
(1992)
Discrete and Computational Geometry
, vol.8
, pp. 131-152
-
-
Djidjev, H.1
Lingas, A.2
Sack, J.-R.3
-
7
-
-
0001961759
-
Link distance problems
-
J.-R. Sack and J. Urrutia, editors, Elsevier Science Publishers B.V. North-Holland, Amsterdam
-
H. Djidjev, A. Maheshwari, and J.-R. Sack, Link distance problems, in J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, Elsevier Science Publishers B.V. North-Holland, Amsterdam, pp. 519-558, 2000.
-
(2000)
Handbook of Computational Geometry
, pp. 519-558
-
-
Djidjev, H.1
Maheshwari, A.2
Sack, J.-R.3
-
8
-
-
0004535292
-
An algorithm for determining visibility of a simple polygon from an internal line segment
-
J.-I. Doh and K.-Y. Chwa, An algorithm for determining visibility of a simple polygon from an internal line segment, Journal of Algorithms, 14, pp. 139-168, 1993.
-
(1993)
Journal of Algorithms
, vol.14
, pp. 139-168
-
-
Doh, J.-I.1
Chwa, K.-Y.2
-
9
-
-
0023247608
-
Linear algorithms for visibility and shortest path problems inside triangulated simple polygons
-
L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan, Linear algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2, pp. 209-233, 1987.
-
(1987)
Algorithmica
, vol.2
, pp. 209-233
-
-
Guibas, L.1
Hershberger, J.2
Leven, D.3
Sharir, M.4
Tarjan, R.5
-
10
-
-
0001757682
-
Approximating polygons and subdivisions with minimum link paths
-
December
-
L. J. Guibas, J. E. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink. Approximating polygons and subdivisions with minimum link paths. Internat. J. Comput. Geom. Appl., 3(4):383-415, December 1993.
-
(1993)
Internat. J. Comput. Geom. Appl.
, vol.3
, Issue.4
, pp. 383-415
-
-
Guibas, L.J.1
Hershberger, J.E.2
Mitchell, J.S.B.3
Snoeyink, J.S.4
-
11
-
-
0346920069
-
Compact interval trees: A data structure for convex hulls
-
L. Guibas, J. Hershberger, and J. Snoeyink, Compact interval trees: a data structure for convex hulls, Intern. J. of Computational Geometry & Applications, 1, pp. 1-22, 1991
-
(1991)
Intern. J. of Computational Geometry & Applications
, vol.1
, pp. 1-22
-
-
Guibas, L.1
Hershberger, J.2
Snoeyink, J.3
-
12
-
-
0001586310
-
Optimal shortest path queries in a simple polygon
-
L. Guibas, J. Hershberger, Optimal shortest path queries in a simple polygon, Journal of Computer and Systems Sciences, vol. 39, pp. 126-152, 1989.
-
(1989)
Journal of Computer and Systems Sciences
, vol.39
, pp. 126-152
-
-
Guibas, L.1
Hershberger, J.2
-
15
-
-
0345874844
-
On the number of links and placement of telescoping manipulators in an environment with obstacles
-
K. Kolarov and B. Roth. On the number of links and placement of telescoping manipulators in an environment with obstacles. In Proc. International Conference on Advanced Robotics, 1991.
-
(1991)
Proc. International Conference on Advanced Robotics
-
-
Kolarov, K.1
Roth, B.2
-
18
-
-
0041111213
-
Computing the link center of a simple polygon
-
W. Lenhart, R. Pollack, J.-R. Sack, R. Seidel, M. Sharir, S. Suri, G. Toussaint, S. Whitesides and C. Yap, Computing the link center of a simple polygon, Discrete and Computational Geometry, 3, pp. 281-293, 1988.
-
(1988)
Discrete and Computational Geometry
, vol.3
, pp. 281-293
-
-
Lenhart, W.1
Pollack, R.2
Sack, J.-R.3
Seidel, R.4
Sharir, M.5
Suri, S.6
Toussaint, G.7
Whitesides, S.8
Yap, C.9
-
19
-
-
0347136063
-
Optimal parallel algorithms for rectilinear link distance problems
-
A. Lingas, A. Maheshwari and J.-R. Sack, Optimal parallel algorithms for rectilinear link distance problems, Algorithmica, 14, 261-289, 1995.
-
(1995)
Algorithmica
, vol.14
, pp. 261-289
-
-
Lingas, A.1
Maheshwari, A.2
Sack, J.-R.3
-
21
-
-
0003009072
-
Automated line generalization
-
R. B. McMaster. Automated line generalization. Cartographica, 26:74-111, 1987.
-
(1987)
Cartographica
, vol.26
, pp. 74-111
-
-
McMaster, R.B.1
-
24
-
-
0023366691
-
Minimizing turns for discrete movement in the interior of a polygon
-
J. Reif and J. A. Storer. Minimizing turns for discrete movement in the interior of a polygon. IEEE Journal of Robotics and Automation, 3:182-193, 1987.
-
(1987)
IEEE Journal of Robotics and Automation
, vol.3
, pp. 182-193
-
-
Reif, J.1
Storer, J.A.2
-
25
-
-
0025508881
-
An optimal algorithm for detecting weak visibility of a polygon
-
J.-R. Sack and S. Suri, An optimal algorithm for detecting weak visibility of a polygon, IEEE Transactions on Computers, 39, pp. 1213-1219, 1990.
-
(1990)
IEEE Transactions on Computers
, vol.39
, pp. 1213-1219
-
-
Sack, J.-R.1
Suri, S.2
-
26
-
-
0003828759
-
-
Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore
-
S. Suri, Minimum link paths in polygons and related problems. Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore, 1987.
-
(1987)
Minimum Link Paths in Polygons and Related Problems
-
-
Suri, S.1
-
27
-
-
0023366861
-
On embedding a graph in the grid with minimum number of bends
-
R. T. Tamassia. On embedding a graph in the grid with minimum number of bends. SIAM Journal on Computing, 16, pp. 421-444, 1987.
-
(1987)
SIAM Journal on Computing
, vol.16
, pp. 421-444
-
-
Tamassia, R.T.1
|