-
1
-
-
84949193801
-
Topological sweeping in three dimensions,” Lecture Notes in Computer Science
-
Springer-Verlag
-
E.G. Anagnostou, L.J. Guibas, and V.G. Polimenis, “Topological sweeping in three dimensions,” Lecture Notes in Computer Science, Vol. 450, Proc. Int’l Symp. on Algorithms, Springer-Verlag, 1990, pp. 310-317.
-
(1990)
Proc. Int’l Symp. On Algorithms
, vol.450
, pp. 310-317
-
-
Anagnostou, E.G.1
Guibas, L.J.2
Polimenis, V.G.3
-
2
-
-
0010466489
-
On minimum-area hulls
-
E.M. Arkin, Y.-J. Chiang, M. Held, J.S.B. Mitchell, V. Sacristan, S.S. Skiena, and T.-C. Yang, “On minimum-area hulls,” Algorithmica, Vol. 21, 1998, pp. 119-136.
-
(1998)
Algorithmica
, vol.21
, pp. 119-136
-
-
Arkin, E.M.1
Chiang, Y.-J.2
Held, M.3
Mitchell, J.4
Sacristan, V.5
Skiena, S.S.6
Yang, T.-C.7
-
3
-
-
0003505509
-
Walking in an arrangement topologically
-
T. Asano, L.J. Guibas, and T. Tokuyama, “Walking in an arrangement topologically,” International Journal of Computational Geometry and Applications, Vol. 4, No. 2, 1994, pp. 123-151.
-
(1994)
International Journal of Computational Geometry and Applications
, vol.4
, Issue.2
, pp. 123-151
-
-
Asano, T.1
Guibas, L.J.2
Tokuyama, T.3
-
5
-
-
0037784114
-
Approximating shortest paths in arrangements of lines
-
P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, and J. Snoeyink, “Approximating shortest paths in arrangements of lines,” Proc. 8th Canadian Conf. on Computational Geometry, 1996, pp. 143-148.
-
(1996)
Proc. 8Th Canadian Conf. On Computational Geometry
, pp. 143-148
-
-
Bose, P.1
Evans, W.2
Kirkpatrick, D.3
McAllister, M.4
Snoeyink, J.5
-
6
-
-
0021788174
-
The power of geometric duality
-
B. Chazelle, L.J. Guibas, and D.T. Lee, “The power of geometric duality,” BIT, Vol. 25, 1985, pp. 76-90.
-
(1985)
BIT
, vol.25
, pp. 76-90
-
-
Chazelle, B.1
Guibas, L.J.2
Lee, D.T.3
-
7
-
-
0032689963
-
Determining an optimal penetration among weighted regions in two and three dimension
-
D.Z. Chen, O. Daescu, X.S. Hu, X. Wu, and J. Xu, “Determining an optimal penetration among weighted regions in two and three dimensions,”Proc. 15th Annual ACM Symp. on Computational Geometry, 1999, pp. 322-331.
-
(1999)
Proc. 15Th Annual ACM Symp. On Computational Geometry
, pp. 322-331
-
-
Chen, D.Z.1
Daescu, O.2
Hu, X.S.3
Wu, X.4
Xu, J.5
-
8
-
-
84896743817
-
Finding an optimal path without growing the tree
-
D.Z. Chen, O. Daescu, X.S. Hu, and J. Xu, “Finding an optimal path without growing the tree,” Proc. 6th Annual European Symp. on Algorithms, 1998, pp. 356-367.
-
(1998)
Proc. 6Th Annual European Symp. On Algorithms
, pp. 356-367
-
-
Chen, D.Z.1
Daescu, O.2
Hu, X.S.3
Xu, J.4
-
9
-
-
70350635159
-
Topological peeling and implementation, 12th Annual
-
D.Z. Chen, S. Luan, and J. Xu, “Topological peeling and implementation,” 12th Annual Int. Symp. on Algorithms and Computation, 2001, pp. 454-466.
-
(2001)
Int. Symp. On Algorithms and Computation
, pp. 454-466
-
-
Chen, D.Z.1
Luan, S.2
Xu, J.3
-
13
-
-
0022714544
-
Constructing arrangements of lines and hyperplanes with applications
-
H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” SIAM J. Computing, Vol. 15, 1986, pp. 341-363.
-
(1986)
SIAM J. Computing
, vol.15
, pp. 341-363
-
-
Edelsbrunner, H.1
O’Rourke, J.2
Seidel, R.3
-
15
-
-
0022663946
-
Constructing belts in two-dimensional arrangements with applications
-
H. Edelsbrunner and E. Welzl, “Constructing belts in two-dimensional arrangements with applications,” SIAM J. Computing, Vol. 15, 1986, pp. 271-284.
-
(1986)
SIAM J. Computing
, vol.15
, pp. 271-284
-
-
Edelsbrunner, H.1
Welzl, E.2
-
18
-
-
0022436559
-
Sorting Jordan sequences in linear time using level-linked search trees
-
K. Hoffman, K. Mehlhorn, R. Rosenstiehl, and R. Tarjan, “Sorting Jordan sequences in linear time using level-linked search trees,” Information and Control, Vol. 68, 1986, pp. 170-184.
-
(1986)
Information and Control
, vol.68
, pp. 170-184
-
-
Hoffman, K.1
Mehlhorn, K.2
Rosenstiehl, R.3
Tarjan, R.4
-
19
-
-
0027961552
-
Faster shortest-path algorithms for planar graphs
-
P.N. Klein, S. Rao, M.H. Rauch, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 27-37.
-
(1994)
Proc. 26Th Annual ACM Symp. Theory of Computing
, pp. 27-37
-
-
Klein, P.N.1
Rao, S.2
Rauch, M.H.3
Subramanian, S.4
-
20
-
-
84947912709
-
On some geometric optimization problems in layered manufacturing
-
J. Majhi, R. Janardan, M. Smid, and P. Gupta, “On some geometric optimization problems in layered manufacturing,” Proc. 5th Int. Workshop on Algorithms and Data Structures, 1997, pp. 136-149.
-
(1997)
Proc. 5Th Int. Workshop on Algorithms and Data Structures
, pp. 136-149
-
-
Majhi, J.1
Janardan, R.2
Smid, M.3
Gupta, P.4
-
21
-
-
65549146343
-
Fast implementation of depth contours using topological sweep
-
K. Miller, S. Ramaswami, P. Rousseeuw, T. Sellares, D. Souvaine, I. Streinu, and A. Struyf, “Fast implementation of depth contours using topological sweep,” Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 690-699.
-
(2001)
Proc. 12Th ACM-SIAM Symp. On Discrete Algorithms
, pp. 690-699
-
-
Miller, K.1
Ramaswami, S.2
Rousseeuw, P.3
Sellares, T.4
Souvaine, D.5
Streinu, I.6
Struyf, A.7
-
22
-
-
84976797161
-
Plane-sweep algorithms for intersecting geometric figures
-
J. Nievergelt and F.P. Preparata, “Plane-sweep algorithms for intersecting geometric figures,” Comm. of the ACM, Vol. 25, No. 10, 1982, pp. 739-747.
-
(1982)
Comm. Of the ACM
, vol.25
, Issue.10
, pp. 739-747
-
-
Nievergelt, J.1
Preparata, F.P.2
|