Leonidas J. Guibas

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
142Supervised Earth Mover's Distance Learning and Its Computer Vision Applications. Fan Wang, Leonidas J. Guibas. ECCV (1) 2012, 442-455. Web SearchBibTeXDownload
141Detecting Network Cliques with Radon Basis Pursuit. Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guibas. Journal of Machine Learning Research - Proceedings Track (22): 565-573 (2012). Web SearchBibTeXDownload
2011
140Joint shape segmentation with linear programming. Qi-Xing Huang, Vladlen Koltun, Leonidas J. Guibas. ACM Trans. Graph. (30): 125 (2011). Web SearchBibTeXDownload
139Probabilistic reasoning for assembly-based 3D modeling. Siddhartha Chaudhuri, Evangelos Kalogerakis, Leonidas J. Guibas, Vladlen Koltun. ACM Trans. Graph. (30): 35 (2011). Web SearchBibTeXDownload
138Approximate Map Matching with respect to the Fréchet Distance. Daniel Chen, Anne Driemel, Leonidas J. Guibas, Andy Nguyen, Carola Wenk. ALENEX 2011, 75-83. Web SearchBibTeXDownload
137Compressive Network Analysis. Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guibas. CoRR (abs/1104.4605) (2011). Web SearchBibTeXDownload
136Kinetic Stable Delaunay Graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. CoRR (abs/1104.0622) (2011). Web SearchBibTeXDownload
135Data-driven trajectory smoothing. Frédéric Chazal, Daniel Chen, Leonidas J. Guibas, Xiaoye Jiang, Christian Sommer. GIS 2011, 251-260. Web SearchBibTeXDownload
134Human action recognition by learning bases of action attributes and parts. Bangpeng Yao, Xiaoye Jiang, Aditya Khosla, Andy Lai Lin, Leonidas J. Guibas, Fei-Fei Li. ICCV 2011, 1331-1338. Web SearchBibTeXDownload
133Select informative features for recognition. Zixuan Wang, Qi Zhao, David Chu, Feng Zhao, Leonidas J. Guibas. ICIP 2011, 2477-2480. Web SearchBibTeXDownload
132Inferring mobile trajectories using a network of binary proximity sensors. Eunjoon Cho, Kevin Wong, Omprakash Gnawali, Martin Wicke, Leonidas J. Guibas. SECON 2011, 188-196. Web SearchBibTeXDownload
2010
131SHREC'10 Track: Feature Detection and Description. Alexander M. Bronstein, Michael M. Bronstein, Benjamin Bustos, Umberto Castellani, Marco Cristani, Bianca Falcidieno, Leonidas J. Guibas, Iasonas Kokkinos, Vittorio Murino, Maks Ovsjanikov, Giuseppe Patanč, Ivan Sipiran, Michela Spagnuolo, Jian Sun. 3DOR 2010, 79-86. Web SearchBibTeXDownload
130Geodesic delaunay triangulations in bounded planar domains. Steve Oudot, Leonidas J. Guibas, Jie Gao, Yue Wang. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
129Road Network Reconstruction for Organizing Paths. Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun. SODA 2010, 1309-1320. Web SearchBibTeXDownload
128Kinetic stable Delaunay graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. Symposium on Computational Geometry 2010, 127-136. Web SearchBibTeXDownload
2009
127Fourier Theoretic Probabilistic Inference over Permutations. Jonathan Huang, Carlos Guestrin, Leonidas J. Guibas. Journal of Machine Learning Research (10): 997-1070 (2009). Web SearchBibTeXDownload
126Exploiting Probabilistic Independence for Permutations. Jonathan Huang, Carlos Guestrin, Xiaoye Jiang, Leonidas J. Guibas. Journal of Machine Learning Research - Proceedings Track (5): 248-255 (2009). Web SearchBibTeXDownload
125Recovering network topology with binary sensors. Eunjoon Cho, Ian Downes, Martin Wicke, Branislav Kusy, Leonidas J. Guibas. SenSys 2009, 387-388. Web SearchBibTeXDownload
2008
124Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks. Rik Sarkar, Xianjin Zhu, Jie Gao, Leonidas J. Guibas, Joseph S. B. Mitchell. INFOCOM 2008, 960-967. Web SearchBibTeXDownload
123Geodesic Delaunay triangulation and witness complex in the plane. Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang. SODA 2008, 571-580. Web SearchBibTeXDownload
122Bounded Uncertainty Roadmaps for Path Planning. Leonidas J. Guibas, David Hsu, Hanna Kurniawati, Ehsan Rehman. WAFR 2008, 199-215. Web SearchBibTeXDownload
2007
121Persistent voids: a new structural metric for membrane fusion. Peter M. Kasson, Afra Zomorodian, Sanghyun Park, Nina Singhal, Leonidas J. Guibas, Vijay S. Pande. Bioinformatics (23): 1753-1759 (2007). Web SearchBibTeXDownload
120On incremental rendering of silhouette maps of a polyhedral scene. Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt, Li Zhang. Comput. Geom. (38): 129-138 (2007). Web SearchBibTeXDownload
119Mobiscopes for Human Spaces. Tarek F. Abdelzaher, Yaw Anokwa, Péter Boda, Jeff Burke, Deborah Estrin, Leonidas J. Guibas, Aman Kansal, Samuel Madden, Jim Reich. IEEE Pervasive Computing (6): 20-29 (2007). Cited by 56Web SearchBibTeXDownload
118Sparse data aggregation in sensor networks. Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger. IPSN 2007, 430-439. Web SearchBibTeXDownload
117Efficient Inference for Distributions on Permutations. Jonathan Huang, Carlos Guestrin, Leonidas J. Guibas. NIPS 2007. Web SearchBibTeXDownload
2006
116Kinetically stable task assignment for networks of microservers. Zoë Abrams, Ho-Lin Chen, Leonidas J. Guibas, Jie Liu, Feng Zhao. IPSN 2006, 93-101. Web SearchBibTeXDownload
115The Identity Management Kalman Filter (IMKF). Brad Schumitsch, Sebastian Thrun, Leonidas J. Guibas, Kunle Olukotun. Robotics: Science and Systems 2006. Web SearchBibTeXDownload
2005
114Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled. CCCG 2005, 43-46. Web SearchBibTeXDownload
113Geometric spanners for routing in mobile networks. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. IEEE Journal on Selected Areas in Communications (23): 174-185 (2005). Web SearchBibTeXDownload
112GLIDER: gradient landmark-based distributed routing for sensor networks. Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silva, Li Zhang. INFOCOM 2005, 339-350. Web SearchBibTeXDownload
111Lazy inference on object identities in wireless sensor networks. Jaewon Shin, Nelson Lee, Sebastian Thrun, Leonidas J. Guibas. IPSN 2005, 174-180. Web SearchBibTeXDownload
2004
110Collision detection for deforming necklaces. Pankaj K. Agarwal, An Nguyen, Daniel Russel, Daniel Russel, Li Zhang. Comput. Geom. (28): 137-163 (2004). Web SearchBibTeXDownload
109Kinetic collision detection between two simple polygons. Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang. Comput. Geom. (27): 211-235 (2004). Web SearchBibTeXDownload
108Fractionally cascaded information in a sensor network. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang. IPSN 2004, 311-319. Web SearchBibTeXDownload
107A probabilistic approach to inference with limited information in sensor networks. Rahul Biswas, Sebastian Thrun, Leonidas J. Guibas. IPSN 2004, 269-276. Web SearchBibTeXDownload
106RoamHBA: maintaining group connectivity in sensor networks. Qing Fang, Jie Liu, Leonidas J. Guibas, Feng Zhao. IPSN 2004, 151-160. Web SearchBibTeXDownload
2003
105Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Discrete & Computational Geometry (30): 591-606 (2003). Web SearchBibTeXDownload
104Discrete Mobile Centers. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. Discrete & Computational Geometry (30): 45-63 (2003). Web SearchBibTeXDownload
103A Distributed Algorithm for Managing Multi-target Identities in Wireless Ad-hoc Sensor Networks. Jaewon Shin, Leonidas J. Guibas, Feng Zhao. IPSN 2003, 223-238. Web SearchBibTeXDownload
102Lightweight sensing and communication protocols for target enumeration and aggregation. Qing Fang, Feng Zhao, Leonidas J. Guibas. MobiHoc 2003, 165-176. Web SearchBibTeXDownload
101Zonotopes as bounding volumes. Leonidas J. Guibas, An Nguyen, Li Zhang. SODA 2003, 803-812. Web SearchBibTeXDownload
2002
100Algorithmic issues in modeling motion. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload
99New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali. Discrete & Computational Geometry (28): 535-569 (2002). Web SearchBibTeXDownload
98Visibility Queries and Maintenance in Simple Polygons. Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang. Discrete & Computational Geometry (27): 461-483 (2002). Web SearchBibTeXDownload
97Kinetic Medians and kd-Trees. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas. ESA 2002, 5-16. Web SearchBibTeXDownload
96Deformable Free-Space Tilings for Kinetic Collision Detection. Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang. I. J. Robotic Res. (21): 179-198 (2002). Web SearchBibTeXDownload
95Collision detection for deforming necklaces. Pankaj K. Agarwal, An Nguyen, Daniel Russel, Daniel Russel, Li Zhang. Symposium on Computational Geometry 2002, 33-42. Web SearchBibTeXDownload
94A dual-space approach to tracking and sensor management in wireless sensor networks. Jie Liu, Patrick Cheung, Feng Zhao, Leonidas J. Guibas. WSNA 2002, 131-139. Web SearchBibTeXDownload
2001
93Scalable nonlinear dynamical systems for agent steering and crowd simulation. Siome Goldenstein, Menelaos I. Karavelas, Dimitris N. Metaxas, Leonidas J. Guibas, Eric Aaron, Ambarish Goswami. Computers & Graphics (25): 983-998 (2001). Web SearchBibTeXDownload
92Maintaining the Extent of a Moving Point Set. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach. Discrete & Computational Geometry (26): 353-374 (2001). Web SearchBibTeXDownload
91Kinetic Connectivity for Unit Disks. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang. Discrete & Computational Geometry (25): 591-610 (2001). Web SearchBibTeXDownload
90Disconnection Proofs for Motion Planning. Julien Basch, Leonidas J. Guibas, David Hsu, An Thai Nguyen. ICRA 2001, 1765-1772. Web SearchBibTeXDownload
89Kinetic Collision Detection: Algorithms and Experiments. Leonidas J. Guibas, Feng Xie, Li Zhang. ICRA 2001, 2903-2910. Web SearchBibTeXDownload
88Scalable Dynamical Systems for Multi-Agent Steering and Simulation. Siome Goldenstein, Menelaos I. Karavelas, Dimitris N. Metaxas, Leonidas J. Guibas, Ambarish Goswami. ICRA 2001, 3973-3980. Web SearchBibTeXDownload
87Geometric spanner for routing in mobile networks. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. MobiHoc 2001, 45-55. Web SearchBibTeXDownload
86Morphing between polylines. Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali. SODA 2001, 680-689. Web SearchBibTeXDownload
85A segment-tree based kinetic BSP. Mark de Berg, Joăo Comba, Leonidas J. Guibas. Symposium on Computational Geometry 2001, 134-140. Web SearchBibTeXDownload
84Discrete mobile centers. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. Symposium on Computational Geometry 2001, 188-196. Web SearchBibTeXDownload
2000
83Cylindrical static and kinetic binary space partitions. Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter. Comput. Geom. (16): 103-127 (2000). Web SearchBibTeXDownload
82A hierarchical method for real-time distance computation among moving convex bodies. Leonidas J. Guibas, David Hsu, Li Zhang. Comput. Geom. (15): 51-68 (2000). Web SearchBibTeXDownload
81Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Discrete & Computational Geometry (24): 721-733 (2000). Web SearchBibTeXDownload
80Morphing Simple Polygons. Leonidas J. Guibas, John Hershberger, Subhash Suri. Discrete & Computational Geometry (24): 1-34 (2000). Web SearchBibTeXDownload
79Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. Nord. J. Comput. (7): 227-240 (2000). Web SearchBibTeX
78On incremental rendering of silhouette maps of polyhedral scene. Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt, Li Zhang. SODA 2000, 910-917. Web SearchBibTeXDownload
77Sweeping simple polygons with a chain of guards. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali. SODA 2000, 927-936. Web SearchBibTeXDownload
76Computing the Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. SWAT 2000, 328-338. Web SearchBibTeXDownload
75Compact Voronoi Diagrams for Moving Convex Polygons. Leonidas J. Guibas, Jack Snoeyink, Li Zhang. SWAT 2000, 339-352. Web SearchBibTeXDownload
74Kinetic connectivity for unit disks. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang. Symposium on Computational Geometry 2000, 331-340. Web SearchBibTeXDownload
1999
73Emerging Challenges in Computational Topology. Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin. CoRR (cs.CG/9909001) (1999). Web SearchBibTeXDownload
72A Visibility-Based Pursuit-Evasion Problem. Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani. Int. J. Comput. Geometry Appl. (9): 471-494 (1999). Cited by 112Web SearchBibTeXDownload
71Data Structures for Mobile Data. Julien Basch, Leonidas J. Guibas, John Hershberger. J. Algorithms (31): 1-28 (1999). Web SearchBibTeXDownload
70Separation-Sensitive Collision Detection for Convex Objects. Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang. SODA 1999, 327-336. Web SearchBibTeXDownload
69Kinetic Collision Detection Between Two Simple Polygons. Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang. SODA 1999, 102-111. Web SearchBibTeXDownload
68Spanning Trees Crossing Few Barriers. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki. Symposium on Computational Geometry 1999, 41-48. Web SearchBibTeXDownload
67Kinetic Data Structures: Animating Proofs Through Time. Julien Basch, Joăo Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang. Symposium on Computational Geometry 1999, 427-428. Web SearchBibTeXDownload
66H-Walk: Hierarchical Distance Computation for Moving Convex Bodies. Leonidas J. Guibas, David Hsu, Li Zhang. Symposium on Computational Geometry 1999, 265-273. Web SearchBibTeXDownload
65Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Symposium on Computational Geometry 1999, 247-254. Web SearchBibTeXDownload
1998
64Euclidean proximity and power diagrams. Leonidas J. Guibas, Li Zhang. CCCG 1998. Web SearchBibTeXDownload
63The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. Mark de Berg, Hazel Everett, Leonidas J. Guibas. Comput. Geom. (11): 69-81 (1998). Web SearchBibTeXDownload
62Separation-Sensitive Collision Detection for Convex Objects. Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang. CoRR (cs.CG/9809035) (1998). Web SearchBibTeXDownload
61Parametric and Kinetic Minimum Spanning Trees. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger. FOCS 1998, 596-605. Cited by 43Web SearchBibTeXDownload
60Visibility Queries in Simple Polygons and Applications. Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang. ISAAC 1998, 357-366. Web SearchBibTeXDownload
59Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas. SODA 1998, 107-116. Web SearchBibTeXDownload
1997
58Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Discrete & Computational Geometry (18): 245 (1997). Web SearchBibTeXDownload
57Finding an unpredictable target in a workspace with obstacles. Steven M. LaValle, David Lin, Leonidas J. Guibas, Jean-Claude Latombe, Rajeev Motwani. ICRA 1997, 737-742. Web SearchBibTeXDownload
56The Robot Localization Problem. Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan. SIAM J. Comput. (26): 1120-1138 (1997). Cited by 88Web SearchBibTeXDownload
55Data Structures for Mobile Data. Julien Basch, Leonidas J. Guibas, John Hershberger. SODA 1997, 747-756. Web SearchBibTeXDownload
54A Practical Evaluation of Kinetic Data Structures. Julien Basch, Leonidas J. Guibas, Craig Silverstein, Li Zhang. Symposium on Computational Geometry 1997, 388-390. Web SearchBibTeXDownload
53Snap Rounding Line Segments Efficiently in Two and Three Dimensions. Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum. Symposium on Computational Geometry 1997, 284-293. Cited by 52Web SearchBibTeXDownload
52Cylindrical Static and Kinetic Binary Space Partitions. Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter. Symposium on Computational Geometry 1997, 39-48. Web SearchBibTeXDownload
51Proximity Problems on Moving Points. Julien Basch, Leonidas J. Guibas, Li Zhang. Symposium on Computational Geometry 1997, 344-351. Web SearchBibTeXDownload
50Visibility-Based Pursuit-Evasion in a Polygonal Environment. Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani. WADS 1997, 17-30. Cited by 109Web SearchBibTeXDownload
49Maintaining the Extent of a Moving Point Set. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach. WADS 1997, 31-44. Web SearchBibTeXDownload
1996
48A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson. Algorithmica (16): 543-547 (1996). Web SearchBibTeXDownload
47Vertical Decompositions for Triangles in 3-Space. Mark de Berg, Leonidas J. Guibas, Dan Halperin. Discrete & Computational Geometry (15): 35-61 (1996). Web SearchBibTeXDownload
1995
46The Centroid of Points with Approximate Weights. Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter. ESA 1995, 460-472. Web SearchBibTeXDownload
45Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. Theor. Comput. Sci. (140): 301-317 (1995). Web SearchBibTeXDownload
1994
44Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. Algorithmica (12): 54-68 (1994). Web SearchBibTeXDownload
43Walking on an arrangement topologically. Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama. Int. J. Comput. Geometry Appl. (4): 123-151 (1994). Web SearchBibTeXDownload
42Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. SIAM J. Comput. (23): 1138-1151 (1994). Web SearchBibTeXDownload
41Vertical Decompositions for Triangles in 3-Space. Mark de Berg, Leonidas J. Guibas, Dan Halperin. Symposium on Computational Geometry 1994, 1-10. Web SearchBibTeXDownload
40Morphing Simple Polygons. Leonidas J. Guibas, John Hershberger, Subhash Suri. Symposium on Computational Geometry 1994, 267-276. Web SearchBibTeXDownload
1993
39An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink. Algorithmica (10): 1-23 (1993). Web SearchBibTeXDownload
38Finding Extrema with Unary Predicates. David G. Kirkpatrick, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe. Algorithmica (9): 591-600 (1993). Web SearchBibTeXDownload
37Approximating Polygons and Subdivisions with Minimum Link Paths. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink. Int. J. Comput. Geometry Appl. (3): 383-415 (1993). Web SearchBibTeXDownload
36Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. ISAAC 1993, 1-10. Web SearchBibTeXDownload
35Computing a Face in an Arrangement of Line Segments and Related Problems. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink. SIAM J. Comput. (22): 1286-1302 (1993). Web SearchBibTeXDownload
1992
34Optimal Placement of Identical Resources in a Tree. Michael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, Nancy A. Lynch. Inf. Comput. (96): 1-54 (1992). Web SearchBibTeXDownload
33The Robot Localization Problem in Two Dimensions. Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan. SODA 1992, 259-268. Cited by 47Web SearchBibTeXDownload
1991
32Counting and Cutting Cycles of Lines and Rods in Space. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Comput. Geom. (1): 305-323 (1991). Web SearchBibTeXDownload
31Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. ICALP 1991, 661-646. Web SearchBibTeXDownload
30Compact interval trees: a data structure for convex hulls. Leonidas J. Guibas, John Hershberger, Jack Snoeyink. Int. J. Comput. Geometry Appl. (1): 1-22 (1991). Web SearchBibTeXDownload
29Approximating Polygons and Subdivisions with Minimum Link Paths. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink. ISA 1991, 151-162. Web SearchBibTeXDownload
28Computing a Face in an Arrangement of Line Segments. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink. SODA 1991, 441-448. Web SearchBibTeXDownload
27Walking on an Arrangement Topologically. Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama. Symposium on Computational Geometry 1991, 297-306. Web SearchBibTeXDownload
26Voronoi Diagrams of Moving Points in the Plane. Jyh-Jong Fu, Richard C. T. Lee. WG 1991, 113-125. Web SearchBibTeXDownload
1990
25Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl. Discrete & Computational Geometry (5): 99-160 (1990). Web SearchBibTeXDownload
24Counting and Cutting Cycles of Lines and Rods in Space. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. FOCS 1990, 242-251. Web SearchBibTeXDownload
23Compact Interval Trees: A Data Structure for Convex Hulls. Leonidas J. Guibas, John Hershberger, Jack Snoeyink. SODA 1990, 169-178. Web SearchBibTeXDownload
22Slimming Down by Adding: Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. Symposium on Computational Geometry 1990, 116-127. Web SearchBibTeXDownload
1989
21On Arrangement of Jordan Arcs with Three Intersection per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Discrete & Computational Geometry (4): 523-539 (1989). Web SearchBibTeXDownload
20Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Discrete & Computational Geometry (4): 433-466 (1989). Web SearchBibTeXDownload
19Optimal Shortest Path Queries in a Simple Polygon. Leonidas J. Guibas, John Hershberger. J. Comput. Syst. Sci. (39): 126-152 (1989). Web SearchBibTeXDownload
1988
18Parallel Computational Geometry. Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap. Algorithmica (3): 293-327 (1988). Web SearchBibTeXDownload
17Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl. FOCS 1988, 568-579. Web SearchBibTeXDownload
16An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. John Hershberger, Leonidas J. Guibas. J. Algorithms (9): 18-46 (1988). Web SearchBibTeXDownload
15An efficient algorithm for finding the CSG representation of a simple polygon. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink. SIGGRAPH 1988, 31-40. Web SearchBibTeXDownload
14Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Symposium on Computational Geometry 1988, 56-69. Web SearchBibTeXDownload
13On Arrangements of Jordan Arcs with Three Intersections per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Symposium on Computational Geometry 1988, 258-265. Web SearchBibTeXDownload
1987
12Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. Algorithmica (2): 209-233 (1987). Web SearchBibTeXDownload
11Optimal Shortest Path Queries in a Simple Polygon. Leonidas J. Guibas, John Hershberger. Symposium on Computational Geometry 1987, 50-63. Web SearchBibTeXDownload
10Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time. Leonidas J. Guibas, Jorge Stolfi, Kenneth L. Clarkson. Theor. Comput. Sci. (49): 81-84 (1987). Web SearchBibTeXDownload
1986
9Visibility of Disjoint Polygons. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. Algorithmica (1): 49-63 (1986). Web SearchBibTeXDownload
8Probabilistic Analysis of a Network Resource Allocation Algorithm. Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas. Information and Control (68): 47-85 (1986). Web SearchBibTeXDownload
7Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. Symposium on Computational Geometry 1986, 1-13. Web SearchBibTeXDownload
1985
6Computing the visibility graphs of n line segments in O(nn) time. Leonidas J. Guibas, John Hershberger. Bulletin of the EATCS (26): 13-20 (1985). Web SearchBibTeX
5Visibility-Polygon Search and Euclidean Shortest Paths. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. FOCS 1985, 155-164. Web SearchBibTeXDownload
4Parallel Computational Geometry (Extended Abstract). Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap. FOCS 1985, 468-477. Web SearchBibTeXDownload
1984
3Guest Editor's Introduction to Special Issue on Computational Geometry. A. Robin Forrest, Leonidas J. Guibas, Jürg Nievergelt. ACM Trans. Graph. (3): 241-243 (1984). Web SearchBibTeXDownload
1981
2Optimal Placement of Identical Resources in a Distributed Network. Michael J. Fischer, Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch. ICDCS 1981, 324-336. Web SearchBibTeX
1Efficient Searching Using Partial Ordering. Allan Borodin, Leonidas J. Guibas, Nancy A. Lynch, Andrew Chi-Chih Yao. Inf. Process. Lett. (12): 71-75 (1981). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research