J. Abello, S. K. Ghosh, L. J. Guibas, J. Hershberger, ...
a polygon from an edge. IEEE Trans. Comput., C-30:910-1014, 1981.
Samuel W. Bent, Daniel D. Sleator, R. Cole, B. Mishra, J. Schmidt, L. J. Guibas, ...
Advanced topics in data structures: bibliography list #2
© 1996 Springer-Verlag New York Inc. Lines in Space: Combinatorics and Algorithms 1 (2008)
B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, J. Stolfi
Abstract. Questions about lines in space arise frequently as subproblems in three-dimensional computational geometry. In this paper we study a number of fundamental combinatorial and algorithmic...
J. Cortial, C. Farhat, L. J. Guibas, M. Rajashekhar
Abstract. This paper discusses recent progress achieved in two areas related to the development of a Dynamic Data Driven Applications System (DDDAS) for structural and material health monitoring and...
Towards a Dynamic Data Driven System for Structural and Material Health Monitoring (2008)
C. Farhat, J. G. Michopoulos, F. K. Chang, L. J. Guibas, A. J. Lew
Abstract. This paper outlines the initial motivations and implementation scope supporting a dynamic data driven application system for material and structural health monitoring as well as critical...
Aarts Korst, M. Abellanas, M. Abellanas, F. Hurtado, ...
Objects and Relations: A ConstraintBased Approach, Dec; World Scientific, Series in Computer Science, 5 [125] T. Kamada, S. Kawai (1988): "A Simple Method for Computing General Position in...
EFFICIENT SEARCHINGUSING PARTIAL ORDERING (2007)
A. Borodin, L. J. Guibas, N. A. Lynch, A. C. Yao
Code] governs the making of photocopies or other reproductions of copyrighted material Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or...
B. Aronov, H. Edelsbrunner, L. J. Guibas, M. Sharir
We show that the maximum number of edges bounding m faces in an arrangement of n line segments in the plane is O(m
polygons. J. Algorithms, 6(2):213–224, 1985. (2004)
L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, R. E. Tarjan
[2] B. Bhattacharya and R. Benkoczi. On computing the optimal bridge between two convex polygons. Inf. Process. Lett., 79(5):215–221, 2001. [3] A. M. Bhosle and T. F. Gonzalez. Approximation...
Lower bounds for kinetic planar subdivisions (1999)
Agarwal, P.K., Basch, J., Berg, M.T. De, Guibas, L.J., Hershberger, J.
We revisit the notion of kinetic efficiency for non-canonically-defined discrete attributes of moving data, like binary space partitions and triangulations. Under very general computational models,...
The union of moving polygonal pseudodiscs - combinatorial bounds and applications (1995)
Berg, M.T. De, Everett, H., Guibas, L.J.
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximum number of combina- torial changes in the union...
Reaching a goal with directional uncertainty (1994)
Berg, M. De, Guibas, L.J., Halperin, D., Overmars, M., Schwarzkopf, O., Sharir, M., ...
We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual...
Vertical decompositions for triangles in 3-space (1994)
Berg, M.T. De, Guibas, L.J., Halperin, D.
We prove that, for any constant " > 0, the complexity of the vertical decomposition of a set of n triangles in three-dimensional space is O(n2+" + K), where K is the complexity of the arrangement of...
The number of edges of many faces in a line segment arrangement (1992)
B. Aronov, H. Edelsbrunner, L. J. Guibas, M. Sharir
We show that the maximum number of edges bounding m faces in an arrangement of n line segments in the plane is O(m 2/3 n 2/3 +nα(n)+n log m). This improves a previous upper bound of Edelsbrunner et...
Elsevier Counting and cutting cycles of lines and rods in space* (1991)
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, ...
306 B. Chazelle et al.