-
2
-
-
0019683897
-
An optimal algorithm for determining the visibility of a polygon from an edge
-
D. Avis and G. T. Toussaint, "An optimal algorithm for determining the visibility of a polygon from an edge," IEEE Transactions on Computers, C-30:910-914, 1981.
-
(1981)
IEEE Transactions on Computers
, vol.C-30
, pp. 910-914
-
-
Avis, D.1
Toussaint, G.T.2
-
4
-
-
79951674611
-
Computing shortest transversals of sets
-
B. K. Bhattacharya, J. Czysowicz, P. Egyed, G. T. Toussaint, I. Stojmenovic and J. Urrutia, "Computing shortest transversals of sets," In Proc. of the Seventh Annual ACM Symp. on Computational Geometry, pp. 71-80, 1991.
-
(1991)
Proc. of the Seventh Annual ACM Symp. on Computational Geometry
, pp. 71-80
-
-
Bhattacharya, B.K.1
Czysowicz, J.2
Egyed, P.3
Toussaint, G.T.4
Stojmenovic, I.5
Urrutia, J.6
-
6
-
-
84955562822
-
Computing in linear time a chord from which a polygon is weakly internally visible
-
Lecture Notes in Computer Science, No. 1004
-
B. K. Bhattacharya and A. Mukhopadhyay, "Computing in linear time a chord from which a polygon is weakly internally visible," In Proc. of 6th Annual International Symposium on Algorithms and Computations, Lecture Notes in Computer Science, No. 1004, pp. 22-31, 1995.
-
(1995)
Proc. of 6th Annual International Symposium on Algorithms and Computations
, pp. 22-31
-
-
Bhattacharya, B.K.1
Mukhopadhyay, A.2
-
7
-
-
0346279545
-
A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
-
B. K. Bhattacharya, A. Mukhopadhyay and G. T. Toussaint, "A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible," In Workshop on algorithms and data structures, pp. 412-424, 1991.
-
(1991)
Workshop on Algorithms and Data Structures
, pp. 412-424
-
-
Bhattacharya, B.K.1
Mukhopadhyay, A.2
Toussaint, G.T.3
-
8
-
-
0025791235
-
Computing shortest transversals
-
B. K. Bhattacharya and G. T. Toussaint, "Computing shortest transversals," Computing, 46:93-119, 1991.
-
(1991)
Computing
, vol.46
, pp. 93-119
-
-
Bhattacharya, B.K.1
Toussaint, G.T.2
-
11
-
-
71649089719
-
An efficient algorithm for finding the CSG representative of a simple polygon
-
D. Dobkin, L. Guibas, J. Hershberger and J. Snoeyink, "An efficient algorithm for finding the CSG representative of a simple polygon," Computer Graphics, 22:31:40, 1988.
-
(1988)
Computer Graphics
, vol.22
, Issue.31
, pp. 40
-
-
Dobkin, D.1
Guibas, L.2
Hershberger, J.3
Snoeyink, J.4
-
12
-
-
0004535292
-
An algorithm for determining internal line visibility of a simple polygon
-
J. Doh and K. Chawa, "An algorithm for determining internal line visibility of a simple polygon," J. of Algorithms, 14:139-168, 1993.
-
(1993)
J. of Algorithms
, vol.14
, pp. 139-168
-
-
Doh, J.1
Chawa, K.2
-
13
-
-
0021899999
-
Finding transversals for sets of simple geometric figures
-
H. Edelsbrunner, "Finding transversals for sets of simple geometric figures," Theoretical Computer Science, 35:55-69, 1985.
-
(1985)
Theoretical Computer Science
, vol.35
, pp. 55-69
-
-
Edelsbrunner, H.1
-
14
-
-
0012960726
-
On common transversals
-
B. Grünbaum, "On common transversals," Arch. Math., 9:465-469, 1958.
-
(1958)
Arch. Math.
, vol.9
, pp. 465-469
-
-
Grünbaum, B.1
-
15
-
-
0026206015
-
A simple algorithm for determining the envelope of a set of lines
-
M. Keil, "A simple algorithm for determining the envelope of a set of lines," Information Processing Letters 39:121:124, 1991.
-
(1991)
Information Processing Letters
, vol.39
, Issue.121
, pp. 124
-
-
Keil, M.1
-
16
-
-
0039614040
-
Two counter-examples concerning transversals for convex subsets of the plane
-
T. Lewis, "Two counter-examples concerning transversals for convex subsets of the plane," Geometriae Dedicata, 9:461:465, 1980.
-
(1980)
Geometriae Dedicata
, vol.9
, Issue.461
, pp. 465
-
-
Lewis, T.1
|