| 2009 |
|---|
| 290 | EE | Frédéric Chazal,
Leonidas J. Guibas,
Steve Oudot,
Primoz Skraba:
Analysis of scalar fields over point cloud data.
SODA 2009: 1021-1030 |
| 289 | EE | Qi-Xing Huang,
Martin Wicke,
Bart Adams,
Leonidas J. Guibas:
Shape Decomposition using Modal Analysis.
Comput. Graph. Forum 28(2): 407-416 (2009) |
| 2008 |
|---|
| 288 | EE | Emilio R. Antúnez,
Leonidas J. Guibas:
Robust extraction of 1D skeletons from grayscale 3D images.
ICPR 2008: 1-4 |
| 287 | EE | Rik Sarkar,
Xianjin Zhu,
Jie Gao,
Leonidas J. Guibas,
Joseph S. B. Mitchell:
Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks.
INFOCOM 2008: 960-967 |
| 286 | EE | Huijia Lin,
Maohua Lu,
Nikola Milosavljevic,
Jie Gao,
Leonidas J. Guibas:
Composable Information Gradients in Wireless Sensor Networks.
IPSN 2008: 121-132 |
| 285 | EE | HyungJune Lee,
Martin Wicke,
Branislav Kusy,
Leonidas J. Guibas:
Localization of mobile users using trajectory matching.
MELT 2008: 123-128 |
| 284 | EE | Jie Gao,
Leonidas J. Guibas,
Steve Oudot,
Yue Wang:
Geodesic Delaunay triangulation and witness complex in the plane.
SODA 2008: 571-580 |
| 283 | EE | Mark Pauly,
Niloy J. Mitra,
Johannes Wallner,
Helmut Pottmann,
Leonidas J. Guibas:
Discovering structural regularity in 3D geometry.
ACM Trans. Graph. 27(3): (2008) |
| 282 | EE | Maks Ovsjanikov,
Jian Sun,
Leonidas J. Guibas:
Global Intrinsic Symmetries of Shapes.
Comput. Graph. Forum 27(5): 1341-1348 (2008) |
| 281 | EE | Qi-Xing Huang,
Bart Adams,
Martin Wicke,
Leonidas J. Guibas:
Non-Rigid Registration Under Isometric Deformations.
Comput. Graph. Forum 27(5): 1449-1457 (2008) |
| 280 | EE | Leonidas J. Guibas,
Steve Oudot:
Reconstruction Using Witness Complexes.
Discrete & Computational Geometry 40(3): 325-356 (2008) |
| 2007 |
|---|
| 279 | | Tarek F. Abdelzaher,
Leonidas J. Guibas,
Matt Welsh:
Proceedings of the 6th International Conference on Information Processing in Sensor Networks, IPSN 2007, Cambridge, Massachusetts, USA, April 25-27, 2007
ACM 2007 |
| 278 | EE | Primoz Skraba,
Leonidas J. Guibas:
Energy Efficient Intrusion Detection in Camera Sensor Networks.
DCOSS 2007: 309-323 |
| 277 | EE | An Nguyen,
Nikola Milosavljevic,
Qing Fang,
Jie Gao,
Leonidas J. Guibas:
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks.
INFOCOM 2007: 661-669 |
| 276 | EE | Jie Gao,
Leonidas J. Guibas,
Nikola Milosavljevic,
John Hershberger:
Sparse data aggregation in sensor networks.
IPSN 2007: 430-439 |
| 275 | EE | Ali Ozer Ercan,
Abbas El Gamal,
Leonidas J. Guibas:
Object tracking in the presence of occlusions via a camera network.
IPSN 2007: 509-518 |
| 274 | EE | J. Cortial,
Charbel Farhat,
Leonidas J. Guibas,
M. Rajashekhar:
Compressed Sensing and Time-Parallel Reduced-Order Modeling for Structural Health Monitoring Using a DDDAS.
International Conference on Computational Science (1) 2007: 1171-1179 |
| 273 | EE | Leonidas J. Guibas:
The geometry of mobility.
MOBICOM 2007: 1 |
| 272 | EE | Jonathan Huang,
Carlos Guestrin,
Leonidas J. Guibas:
Efficient Inference for Distributions on Permutations.
NIPS 2007 |
| 271 | EE | Leonidas J. Guibas,
Steve Oudot:
Reconstruction using witness complexes.
SODA 2007: 1076-1085 |
| 270 | EE | Jean-Daniel Boissonnat,
Leonidas J. Guibas,
Steve Oudot:
Manifold reconstruction in arbitrary dimensions using witness complexes.
Symposium on Computational Geometry 2007: 194-203 |
| 269 | EE | Niloy J. Mitra,
Simon Flöry,
Maks Ovsjanikov,
Natasha Gelfand,
Leonidas J. Guibas,
Helmut Pottmann:
Dynamic geometry registration.
Symposium on Geometry Processing 2007: 173-182 |
| 268 | EE | Michael Wand,
Philipp Jenke,
Qi-Xing Huang,
Martin Bokeloh,
Leonidas J. Guibas,
Andreas Schilling:
Reconstruction of deforming geometry from time-varying point clouds.
Symposium on Geometry Processing 2007: 49-58 |
| 267 | EE | Bart Adams,
Mark Pauly,
Richard Keiser,
Leonidas J. Guibas:
Adaptively sampled particle fluids.
ACM Trans. Graph. 26(3): 48 (2007) |
| 266 | EE | Niloy J. Mitra,
Leonidas J. Guibas,
Mark Pauly:
Symmetrization.
ACM Trans. Graph. 26(3): 63 (2007) |
| 265 | EE | Leonidas J. Guibas,
Yusu Wang:
Toward Unsupervised Segmentation of Semi-Rigid Low-Resolution Molecular Surfaces.
Algorithmica 48(4): 433-438 (2007) |
| 264 | EE | Peter M. Kasson,
Afra Zomorodian,
Sanghyun Park,
Nina Singhal,
Leonidas J. Guibas,
Vijay S. Pande:
Persistent voids: a new structural metric for membrane fusion.
Bioinformatics 23(14): 1753-1759 (2007) |
| 263 | EE | Jean-Daniel Boissonnat,
Leonidas J. Guibas,
Steve Oudot:
Learning smooth shapes by probing.
Comput. Geom. 37(1): 38-58 (2007) |
| 262 | EE | Daniel Russel,
Menelaos I. Karavelas,
Leonidas J. Guibas:
A package for exact kinetic data structures and sweepline algorithms.
Comput. Geom. 38(1-2): 111-127 (2007) |
| 261 | EE | Alon Efrat,
Leonidas J. Guibas,
Olaf A. Hall-Holt,
Li Zhang:
On incremental rendering of silhouette maps of a polyhedral scene.
Comput. Geom. 38(3): 129-138 (2007) |
| 260 | EE | Tarek F. Abdelzaher,
Yaw Anokwa,
Péter Boda,
Jeff Burke,
Deborah Estrin,
Leonidas J. Guibas,
Aman Kansal,
Samuel Madden,
Jim Reich:
Mobiscopes for Human Spaces.
IEEE Pervasive Computing 6(2): 20-29 (2007) |
| 2006 |
|---|
| 259 | | Leonidas J. Guibas,
Uwe D. Hanebeck,
Thomas C. Henderson:
Form and Content in Sensor Networks, 18.09. - 23.09.2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 258 | EE | Stefan Funke,
Leonidas J. Guibas,
An Nguyen,
Yusu Wang:
Distance-Sensitive Information Brokerage in Sensor Networks.
DCOSS 2006: 234-251 |
| 257 | EE | Ali Ozer Ercan,
Danny B. Yang,
Abbas El Gamal,
Leonidas J. Guibas:
Optimal Placement and Selection of Camera Network Nodes for Target Localization.
DCOSS 2006: 389-404 |
| 256 | EE | Yusu Wang,
Leonidas J. Guibas:
Towards Unsupervised Segmentation of Semi-rigid Low-Resolution Molecular Surfaces.
GMP 2006: 129-142 |
| 255 | EE | Qing Fang,
Jie Gao,
Leonidas J. Guibas:
Landmark-Based Information Storage and Retrieval in Sensor Networks.
INFOCOM 2006 |
| 254 | EE | Primoz Skraba,
Qing Fang,
An Thai Nguyen,
Leonidas J. Guibas:
Sweeps over wireless sensor networks.
IPSN 2006: 143-151 |
| 253 | EE | Zoë Abrams,
Ho-Lin Chen,
Leonidas J. Guibas,
Jie Liu,
Feng Zhao:
Kinetically stable task assignment for networks of microservers.
IPSN 2006: 93-101 |
| 252 | EE | Charbel Farhat,
John Michopoulos,
F. K. Chang,
Leonidas J. Guibas,
A. J. Lew:
Towards a Dynamic Data Driven System for Structural and Material Health Monitoring.
International Conference on Computational Science (3) 2006: 456-464 |
| 251 | EE | Brad Schumitsch,
Sebastian Thrun,
Leonidas J. Guibas,
Kunle Olukotun:
The Identity Management Kalman Filter (IMKF).
Robotics: Science and Systems 2006 |
| 250 | EE | Niloy J. Mitra,
Leonidas J. Guibas,
Joachim Giesen,
Mark Pauly:
Probabilistic fingerprints for shapes.
Symposium on Geometry Processing 2006: 121-130 |
| 249 | EE | Niloy J. Mitra,
Leonidas J. Guibas,
Mark Pauly:
Partial and approximate symmetry detection for 3D geometry.
ACM Trans. Graph. 25(3): 560-568 (2006) |
| 248 | EE | Jie Gao,
Leonidas J. Guibas,
An Thai Nguyen:
Deformable spanners and applications.
Comput. Geom. 35(1-2): 2-19 (2006) |
| 247 | EE | Afra Zomorodian,
Leonidas J. Guibas,
Patrice Koehl:
Geometric filtering of pairwise atomic interactions applied to the design of efficient statistical potentials.
Computer Aided Geometric Design 23(6): 531-544 (2006) |
| 246 | EE | Qing Fang,
Jie Gao,
Leonidas J. Guibas:
Locating and Bypassing Holes in Sensor Networks.
MONET 11(2): 187-200 (2006) |
| 2005 |
|---|
| 245 | EE | Pankaj K. Agarwal,
Mark de Berg,
Jie Gao,
Leonidas J. Guibas,
Sariel Har-Peled:
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points.
CCCG 2005: 43-46 |
| 244 | EE | Jie Gao,
Leonidas J. Guibas,
An Nguyen:
Distributed Proximity Maintenance in Ad Hoc Mobile Networks.
DCOSS 2005: 4-19 |
| 243 | EE | Leonidas J. Guibas,
Uwe D. Hanebeck,
Thomas C. Henderson:
05381 Abstracts Collection -- Form and Content in Sensor Networks.
Form and Content in Sensor Networks 2005 |
| 242 | EE | Leonidas J. Guibas,
Uwe D. Hanebeck,
Thomas C. Henderson:
05381 Executive Summary -- Form and Content in Sensor Networks.
Form and Content in Sensor Networks 2005 |
| 241 | EE | Qing Fang,
Jie Gao,
Leonidas J. Guibas,
V. de Silva,
Li Zhang:
GLIDER: gradient landmark-based distributed routing for sensor networks.
INFOCOM 2005: 339-350 |
| 240 | EE | Jaewon Shin,
Nelson Lee,
Sebastian Thrun,
Leonidas J. Guibas:
Lazy inference on object identities in wireless sensor networks.
IPSN 2005: 174-180 |
| 239 | EE | Daniel Russel,
Leonidas J. Guibas:
Exploring Protein Folding Trajectories Using Geometric Spanners.
Pacific Symposium on Biocomputing 2005: 42-53 |
| 238 | EE | Jean-Daniel Boissonnat,
Leonidas J. Guibas,
Steve Oudot:
Learning smooth objects by probing.
Symposium on Computational Geometry 2005: 198-207 |
| 237 | EE | Jean-Daniel Boissonnat,
Leonidas J. Guibas,
Steve Oudot:
Learning smooth objects by probing.
Symposium on Computational Geometry 2005: 364-365 |
| 236 | | Natasha Gelfand,
Niloy J. Mitra,
Leonidas J. Guibas,
Helmut Pottmann:
Robust Global Registration.
Symposium on Geometry Processing 2005: 197-206 |
| 235 | | Mark Pauly,
Niloy J. Mitra,
Joachim Giesen,
Markus H. Gross,
Leonidas J. Guibas:
Example-Based 3D Scan Completion.
Symposium on Geometry Processing 2005: 23-32 |
| 234 | EE | Mark Pauly,
Richard Keiser,
Bart Adams,
Philip Dutré,
Markus H. Gross,
Leonidas J. Guibas:
Meshless animation of fracturing solids.
ACM Trans. Graph. 24(3): 957-964 (2005) |
| 233 | EE | Ho Kyung Kim,
Leonidas J. Guibas,
Sung Yong Shin:
Efficient Collision Detection among Moving Spheres with Unknown Trajectories.
Algorithmica 43(3): 195-210 (2005) |
| 232 | EE | Bart Adams,
Richard Keiser,
Mark Pauly,
Leonidas J. Guibas,
Markus H. Gross,
Philip Dutré:
Efficient Raytracing of Deforming Point-Sampled Surfaces.
Comput. Graph. Forum 24(3): 677-684 (2005) |
| 231 | EE | Rachel Kolodny,
Leonidas J. Guibas,
Michael Levitt,
Patrice Koehl:
Inverse Kinematics in Biology: The Protein Loop Closure Problem.
I. J. Robotic Res. 24(2-3): 151-163 (2005) |
| 230 | EE | Jie Gao,
Leonidas J. Guibas,
John Hershberger,
Li Zhang,
An Zhu:
Geometric spanners for routing in mobile networks.
IEEE Journal on Selected Areas in Communications 23(1): 174-185 (2005) |
| 229 | EE | Gunnar Carlsson,
Afra Zomorodian,
Anne D. Collins,
Leonidas J. Guibas:
Persistence Barcodes for Shapes.
International Journal of Shape Modeling 11(2): 149-188 (2005) |
| 2004 |
|---|
| 228 | | Leonidas J. Guibas,
Menelaos I. Karavelas,
Daniel Russel:
A Computational Framework for Handling Motion.
ALENEX/ANALC 2004: 129-141 |
| 227 | EE | Qing Fang,
Jie Gao,
Leonidas J. Guibas:
Locating and Bypassing Routing Holes in Sensor Networks.
INFOCOM 2004 |
| 226 | EE | Qing Fang,
Jie Liu,
Leonidas J. Guibas,
Feng Zhao:
RoamHBA: maintaining group connectivity in sensor networks.
IPSN 2004: 151-160 |
| 225 | EE | Rahul Biswas,
Sebastian Thrun,
Leonidas J. Guibas:
A probabilistic approach to inference with limited information in sensor networks.
IPSN 2004: 269-276 |
| 224 | EE | Jie Gao,
Leonidas J. Guibas,
John Hershberger,
Li Zhang:
Fractionally cascaded information in a sensor network.
IPSN 2004: 311-319 |
| 223 | EE | Leonidas J. Guibas,
Daniel Russel:
An empirical comparison of techniques for updating Delaunay triangulations.
Symposium on Computational Geometry 2004: 170-179 |
| 222 | EE | Jie Gao,
Leonidas J. Guibas,
An Nguyen:
Deformable spanners and applications.
Symposium on Computational Geometry 2004: 190-199 |
| 221 | | Gunnar Carlsson,
Afra Zomorodian,
Anne D. Collins,
Leonidas J. Guibas:
Persistence Barcodes for Shapes.
Symposium on Geometry Processing 2004: 127-138 |
| 220 | | Natasha Gelfand,
Leonidas J. Guibas:
Shape Segmentation Using Local Slippage Analysis.
Symposium on Geometry Processing 2004: 219-228 |
| 219 | | Niloy J. Mitra,
Natasha Gelfand,
Helmut Pottmann,
Leonidas J. Guibas:
Registration of Point Cloud Data from a Geometric Optimization Perspective.
Symposium on Geometry Processing 2004: 23-32 |
| 218 | | Leonidas J. Guibas:
Local and Global Analysis for Point Cloud Data.
VMV 2004: 185 |
| 217 | EE | Julien Basch,
Jeff Erickson,
Leonidas J. Guibas,
John Hershberger,
Li Zhang:
Kinetic collision detection between two simple polygons.
Comput. Geom. 27(3): 211-235 (2004) |
| 216 | EE | Pankaj K. Agarwal,
Leonidas J. Guibas,
An Thai Nguyen,
Daniel Russel,
Li Zhang:
Collision detection for deforming necklaces.
Comput. Geom. 28(2-3): 137-163 (2004) |
| 215 | EE | Anne D. Collins,
Afra Zomorodian,
Gunnar Carlsson,
Leonidas J. Guibas:
A barcode shape descriptor for curve point cloud data.
Computers & Graphics 28(6): 881-894 (2004) |
| 214 | EE | Niloy J. Mitra,
An Nguyen,
Leonidas J. Guibas:
Estimating surface normals in noisy point cloud data.
Int. J. Comput. Geometry Appl. 14(4-5): 261-276 (2004) |
| 2003 |
|---|
| 213 | | Feng Zhao,
Leonidas J. Guibas:
Information Processing in Sensor Networks, Second International Workshop, IPSN 2003, Palo Alto, CA, USA, April 22-23, 2003, Proceedings
Springer 2003 |
| 212 | EE | Danny B. Yang,
Héctor H. González-Baños,
Leonidas J. Guibas:
Counting People in Crowds with a Real-Time Network of Simple Image Sensors.
ICCV 2003: 122-129 |
| 211 | EE | Jaewon Shin,
Leonidas J. Guibas,
Feng Zhao:
A Distributed Algorithm for Managing Multi-target Identities in Wireless Ad-hoc Sensor Networks.
IPSN 2003: 223-238 |
| 210 | EE | Qing Fang,
Feng Zhao,
Leonidas J. Guibas:
Lightweight sensing and communication protocols for target enumeration and aggregation.
MobiHoc 2003: 165-176 |
| 209 | EE | Leonidas J. Guibas,
An Nguyen,
Li Zhang:
Zonotopes as bounding volumes.
SODA 2003: 803-812 |
| 208 | EE | Julien Basch,
Leonidas J. Guibas,
G. D. Ramkumar:
Reporting Red - Blue Intersections between Two Sets of Connected Line Segments.
Algorithmica 35(1): 1-20 (2003) |
| 207 | EE | Jie Gao,
Leonidas J. Guibas,
John Hershberger,
Li Zhang,
An Zhu:
Discrete Mobile Centers.
Discrete & Computational Geometry 30(1): 45-63 (2003) |
| 206 | EE | Tetsuo Asano,
Mark de Berg,
Otfried Cheong,
Leonidas J. Guibas,
Jack Snoeyink,
Hisao Tamaki:
Spanning Trees Crossing Few Barriers.
Discrete & Computational Geometry 30(4): 591-606 (2003) |
| 2002 |
|---|
| 205 | EE | Pankaj K. Agarwal,
Jie Gao,
Leonidas J. Guibas:
Kinetic Medians and kd-Trees.
ESA 2002: 5-16 |
| 204 | EE | Leonidas J. Guibas,
An Nguyen,
Daniel Russel,
Li Zhang:
Collision detection for deforming necklaces.
Symposium on Computational Geometry 2002: 33-42 |
| 203 | EE | Jie Liu,
Patrick Cheung,
Feng Zhao,
Leonidas J. Guibas:
A dual-space approach to tracking and sensor management in wireless sensor networks.
WSNA 2002: 131-139 |
| 202 | EE | 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:
Algorithmic issues in modeling motion.
ACM Comput. Surv. 34(4): 550-572 (2002) |
| 201 | EE | Boris Aronov,
Leonidas J. Guibas,
Marek Teichmann,
Li Zhang:
Visibility Queries and Maintenance in Simple Polygons.
Discrete & Computational Geometry 27(4): 461-483 (2002) |
| 200 | EE | Alon Efrat,
Leonidas J. Guibas,
Sariel Har-Peled,
Joseph S. B. Mitchell,
T. M. Murali:
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping.
Discrete & Computational Geometry 28(4): 535-569 (2002) |
| 199 | | Pankaj K. Agarwal,
Julien Basch,
Leonidas J. Guibas,
John Hershberger,
Li Zhang:
Deformable Free-Space Tilings for Kinetic Collision Detection.
I. J. Robotic Res. 21(3): 179-198 (2002) |
| 2001 |
|---|
| 198 | | Julien Basch,
Leonidas J. Guibas,
David Hsu,
An Thai Nguyen:
Disconnection Proofs for Motion Planning.
ICRA 2001: 1765-1772 |
| 197 | | Leonidas J. Guibas,
Feng Xie,
Li Zhang:
Kinetic Collision Detection: Algorithms and Experiments.
ICRA 2001: 2903-2910 |
| 196 | | Siome Goldenstein,
Menelaos I. Karavelas,
Dimitris N. Metaxas,
Leonidas J. Guibas,
Ambarish Goswami:
Scalable Dynamical Systems for Multi-Agent Steering and Simulation.
ICRA 2001: 3973-3980 |
| 195 | EE | Jie Gao,
Leonidas J. Guibas,
John Hershberger,
Li Zhang,
An Zhu:
Geometric spanner for routing in mobile networks.
MobiHoc 2001: 45-55 |
| 194 | EE | Menelaos I. Karavelas,
Leonidas J. Guibas:
Static and kinetic geometric spanners with applications.
SODA 2001: 168-176 |
| 193 | EE | Alon Efrat,
Sariel Har-Peled,
Leonidas J. Guibas,
T. M. Murali:
Morphing between polylines.
SODA 2001: 680-689 |
| 192 | EE | Mark de Berg,
João Comba,
Leonidas J. Guibas:
A segment-tree based kinetic BSP.
Symposium on Computational Geometry 2001: 134-140 |
| 191 | EE | Jie Gao,
Leonidas J. Guibas,
John Hershberger,
Li Zhang,
An Zhu:
Discrete mobile centers.
Symposium on Computational Geometry 2001: 188-196 |
| 190 | EE | Siome Goldenstein,
Menelaos I. Karavelas,
Dimitris N. Metaxas,
Leonidas J. Guibas,
Eric Aaron,
Ambarish Goswami:
Scalable nonlinear dynamical systems for agent steering and crowd simulation.
Computers & Graphics 25(6): 983-998 (2001) |
| 189 | EE | Leonidas J. Guibas,
John Hershberger,
Subhash Suri,
Li Zhang:
Kinetic Connectivity for Unit Disks.
Discrete & Computational Geometry 25(4): 591-610 (2001) |
| 188 | EE | Pankaj K. Agarwal,
Leonidas J. Guibas,
John Hershberger,
Eric Veach:
Maintaining the Extent of a Moving Point Set.
Discrete & Computational Geometry 26(3): 353-374 (2001) |
| 2000 |
|---|
| 187 | EE | Leonidas J. Guibas:
Data structures for mobile data.
DIAL-M 2000: 46-53 |
| 186 | EE | Alon Efrat,
Leonidas J. Guibas,
Olaf A. Hall-Holt,
Li Zhang:
On incremental rendering of silhouette maps of polyhedral scene.
SODA 2000: 910-917 |
| 185 | EE | Alon Efrat,
Leonidas J. Guibas,
Sariel Har-Peled,
David C. Lin,
Joseph S. B. Mitchell,
T. M. Murali:
Sweeping simple polygons with a chain of guards.
SODA 2000: 927-936 |
| 184 | EE | Pankaj K. Agarwal,
Leonidas J. Guibas,
Sariel Har-Peled,
Alexander Rabinovitch,
Micha Sharir:
Computing the Penetration Depth of Two Convex Polytopes in 3D.
SWAT 2000: 328-338 |
| 183 | EE | Leonidas J. Guibas,
Jack Snoeyink,
Li Zhang:
Compact Voronoi Diagrams for Moving Convex Polygons.
SWAT 2000: 339-352 |
| 182 | EE | Leonidas J. Guibas,
John Hershberger,
Subhash Suri,
Li Zhang:
Kinetic connectivity for unit disks.
Symposium on Computational Geometry 2000: 331-340 |
| 181 | | Leonidas J. Guibas,
David Hsu,
Li Zhang:
A hierarchical method for real-time distance computation among moving convex bodies.
Comput. Geom. 15(1-3): 51-68 (2000) |
| 180 | | Pankaj K. Agarwal,
Leonidas J. Guibas,
T. M. Murali,
Jeffrey Scott Vitter:
Cylindrical static and kinetic binary space partitions.
Comput. Geom. 16(2): 103-127 (2000) |
| 179 | EE | Leonidas J. Guibas,
John Hershberger,
Subhash Suri:
Morphing Simple Polygons.
Discrete & Computational Geometry 24(1): 1-34 (2000) |
| 178 | EE | Pankaj K. Agarwal,
Julien Basch,
Mark de Berg,
Leonidas J. Guibas,
John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions.
Discrete & Computational Geometry 24(4): 721-733 (2000) |
| 177 | | Yossi Rubner,
Carlo Tomasi,
Leonidas J. Guibas:
The Earth Mover's Distance as a Metric for Image Retrieval.
International Journal of Computer Vision 40(2): 99-121 (2000) |
| 176 | | Pankaj K. Agarwal,
Leonidas J. Guibas,
Sariel Har-Peled,
Alexander Rabinovitch,
Micha Sharir:
Penetration Depth of Two Convex Polytopes in 3D.
Nord. J. Comput. 7(3): 227-240 (2000) |
| 1999 |
|---|
| 175 | EE | Scott D. Cohen,
Leonidas J. Guibas:
The Earth Mover's Distance under Transformation Sets.
ICCV 1999: 1076-1083 |
| 174 | EE | Julien Basch,
Jeff Erickson,
Leonidas J. Guibas,
John Hershberger,
Li Zhang:
Kinetic Collision Detection Between Two Simple Polygons.
SODA 1999: 102-111 |
| 173 | EE | Jeff Erickson,
Leonidas J. Guibas,
Jorge Stolfi,
Li Zhang:
Separation-Sensitive Collision Detection for Convex Objects.
SODA 1999: 327-336 |
| 172 | EE | Pankaj K. Agarwal,
Julien Basch,
Mark de Berg,
Leonidas J. Guibas,
John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions.
Symposium on Computational Geometry 1999: 247-254 |
| 171 | EE | Leonidas J. Guibas,
Menelaos I. Karavelas:
Interval Methods for Kinetic Simulations.
Symposium on Computational Geometry 1999: 255-264 |
| 170 | EE | Leonidas J. Guibas,
David Hsu,
Li Zhang:
H-Walk: Hierarchical Distance Computation for Moving Convex Bodies.
Symposium on Computational Geometry 1999: 265-273 |
| 169 | EE | Tetsuo Asano,
Mark de Berg,
Otfried Cheong,
Leonidas J. Guibas,
Jack Snoeyink,
Hisao Tamaki:
Spanning Trees Crossing Few Barriers.
Symposium on Computational Geometry 1999: 41-48 |
| 168 | EE | Julien Basch,
João Comba,
Leonidas J. Guibas,
John Hershberger,
Craig Silverstein,
Li Zhang:
Kinetic Data Structures: Animating Proofs Through Time.
Symposium on Computational Geometry 1999: 427-428 |
| 167 | EE | 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:
Emerging Challenges in Computational Topology
CoRR cs.CG/9909001: (1999) |
| 166 | | Leonidas J. Guibas,
Jean-Claude Latombe,
Steven M. LaValle,
David Lin,
Rajeev Motwani:
A Visibility-Based Pursuit-Evasion Problem.
Int. J. Comput. Geometry Appl. 9(4/5): 471- (1999) |
| 165 | | Julien Basch,
Leonidas J. Guibas,
John Hershberger:
Data Structures for Mobile Data.
J. Algorithms 31(1): 1-28 (1999) |
| 1998 |
|---|
| 164 | | Yossi Rubner,
Carlo Tomasi,
Leonidas J. Guibas:
Adaptive Color-Image Embeddings for Database Navigation.
ACCV (1) 1998: 104-111 |
| 163 | EE | Leonidas J. Guibas,
Li Zhang:
Euclidean proximity and power diagrams.
CCCG 1998 |
| 162 | EE | Pankaj K. Agarwal,
David Eppstein,
Leonidas J. Guibas,
Monika Rauch Henzinger:
Parametric and Kinetic Minimum Spanning Trees.
FOCS 1998: 596-605 |
| 161 | | Yossi Rubner,
Carlo Tomasi,
Leonidas J. Guibas:
A Metric for Distributions with Applications to Image Databases.
ICCV 1998: 59-66 |
| 160 | EE | Boris Aronov,
Leonidas J. Guibas,
Marek Teichmann,
Li Zhang:
Visibility Queries in Simple Polygons and Applications.
ISAAC 1998: 357-366 |
| 159 | | Pankaj K. Agarwal,
Jeff Erickson,
Leonidas J. Guibas:
Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract).
SODA 1998: 107-116 |
| 158 | EE | Jeff Erickson,
Leonidas J. Guibas,
Jorge Stolfi,
Li Zhang:
Separation-Sensitive Collision Detection for Convex Objects
CoRR cs.CG/9809035: (1998) |
| 157 | | Mark de Berg,
Hazel Everett,
Leonidas J. Guibas:
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications.
Comput. Geom. 11(2): 69-81 (1998) |
| 156 | EE | Dong Jin Kim,
Leonidas J. Guibas,
Sung Yong Shin:
Fast Collision Detection Among Multiple Moving Spheres.
IEEE Trans. Vis. Comput. Graph. 4(3): 230-242 (1998) |
| 155 | | Leonidas J. Guibas,
David H. Marimont:
Rounding Arrangements Dynamically.
Int. J. Comput. Geometry Appl. 8(2): 157-176 (1998) |
| 154 | | Leonidas J. Guibas,
Dan Halperin,
Hirohisa Hirukawa,
Jean-Claude Latombe,
Randall H. Wilson:
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes.
Int. J. Comput. Geometry Appl. 8(2): 179-200 (1998) |
| 153 | | Gerhard Albers,
Leonidas J. Guibas,
Joseph S. B. Mitchell,
Thomas Roos:
Voronoi Diagrams of Moving Points.
Int. J. Comput. Geometry Appl. 8(3): 365-380 (1998) |
| 1997 |
|---|
| 152 | EE | Dong Jin Kim,
Sung Yong Shin,
Leonidas J. Guibas:
Fast Collision Detection among Multiple Moving Spheres.
CA 1997: 1-7 |
| 151 | EE | Eric Veach,
Leonidas J. Guibas:
Metropolis light transport.
SIGGRAPH 1997: 65-76 |
| 150 | | Julien Basch,
Leonidas J. Guibas,
John Hershberger:
Data Structures for Mobile Data.
SODA 1997: 747-756 |
| 149 | | Scott D. Cohen,
Leonidas J. Guibas:
Partial Matching of Planar Polylines Under Similarity Transformations.
SODA 1997: 777-786 |
| 148 | EE | Michael T. Goodrich,
Leonidas J. Guibas,
John Hershberger,
Paul J. Tanenbaum:
Snap Rounding Line Segments Efficiently in Two and Three Dimensions.
Symposium on Computational Geometry 1997: 284-293 |
| 147 | EE | Julien Basch,
Leonidas J. Guibas,
Li Zhang:
Proximity Problems on Moving Points.
Symposium on Computational Geometry 1997: 344-351 |
| 146 | EE | Dong Jin Kim,
Leonidas J. Guibas,
Sung Yong Shin:
Fast Collision Detection Among Multiple Moving Spheres.
Symposium on Computational Geometry 1997: 373-375 |
| 145 | EE | Julien Basch,
Leonidas J. Guibas,
Craig Silverstein,
Li Zhang:
A Practical Evaluation of Kinetic Data Structures.
Symposium on Computational Geometry 1997: 388-390 |
| 144 | EE | Pankaj K. Agarwal,
Leonidas J. Guibas,
T. M. Murali,
Jeffrey Scott Vitter:
Cylindrical Static and Kinetic Binary Space Partitions.
Symposium on Computational Geometry 1997: 39-48 |
| 143 | EE | Julien Basch,
Leonidas J. Guibas,
G. D. Ramkumar:
Sweeping Lines and Line Segments with a Heap.
Symposium on Computational Geometry 1997: 469-471 |
| 142 | | Leonidas J. Guibas,
Jean-Claude Latombe,
Steven M. LaValle,
David Lin,
Rajeev Motwani:
Visibility-Based Pursuit-Evasion in a Polygonal Environment.
WADS 1997: 17-30 |
| 141 | | Pankaj K. Agarwal,
Leonidas J. Guibas,
John Hershberger,
Eric Veach:
Maintaining the Extent of a Moving Point Set.
WADS 1997: 31-44 |
| 140 | EE | Leonidas J. Guibas:
Guest Editor's Foreword.
Discrete & Computational Geometry 18(3): 245-245 (1997) |
| 139 | | Prosenjit Bose,
Leonidas J. Guibas,
Anna Lubiw,
Mark H. Overmars,
Diane L. Souvaine,
Jorge Urrutia:
The Floodlight Problem.
Int. J. Comput. Geometry Appl. 7(1/2): 153-163 (1997) |
| 138 | | Leonidas J. Guibas,
Rajeev Motwani,
Prabhakar Raghavan:
The Robot Localization Problem.
SIAM J. Comput. 26(4): 1120-1138 (1997) |
| 1996 |
|---|
| 137 | | Julien Basch,
Leonidas J. Guibas,
G. D. Ramkumar:
Reporting Red-Blue Intersections between Two Sets of Connected Line Segments.
ESA 1996: 302-319 |
| 136 | | Leonidas J. Guibas:
Implementing Geometric Algorithms Robustly.
WACG 1996: 15-22 |
| 135 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir,
Jorge Stolfi:
Lines in Space: Combinatorics and Algorithms.
Algorithmica 15(5): 428-447 (1996) |
| 134 | | Helmut Alt,
Leonidas J. Guibas,
Kurt Mehlhorn,
Richard M. Karp,
Avi Wigderson:
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Algorithmica 16(4/5): 543-547 (1996) |
| 133 | | Leonidas J. Guibas,
Mark H. Overmars,
Jean-Marc Robert:
The Exact Fitting Problem in Higher Dimensions.
Comput. Geom. 6: 215-230 (1996) |
| 132 | EE | Gill Barequet,
Bernard Chazelle,
Leonidas J. Guibas,
Joseph S. B. Mitchell,
Ayellet Tal:
BOXTREE: A Hierarchical Representation for Surfaces in 3D.
Comput. Graph. Forum 15(3): 387-396 (1996) |
| 131 | EE | Mark de Berg,
Leonidas J. Guibas,
Dan Halperin:
Vertical Decompositions for Triangles in 3-Space.
Discrete & Computational Geometry 15(1): 35-61 (1996) |
| 1995 |
|---|
| 130 | | Marshall W. Bern,
David Eppstein,
Leonidas J. Guibas,
John Hershberger,
Subhash Suri,
Jan Wolter:
The Centroid of Points with Approximate Weights.
ESA 1995: 460-472 |
| 129 | | Leonidas J. Guibas,
Dan Halperin,
Hirohisa Hirukawa,
Jean-Claude Latombe,
Randall H. Wilson:
A Simple and Effeicient Procedure for Polyhedral Assembly Partitioning under Infinitesimal Motions.
ICRA 1995: 2553-2560 |
| 128 | EE | Eric Veach,
Leonidas J. Guibas:
Optimally combining sampling techniques for Monte Carlo rendering.
SIGGRAPH 1995: 419-428 |
| 127 | | Leonidas J. Guibas,
Brian Rogoff,
Carlo Tomasi:
Fixed-Window Image Descriptors for Image Retrieval.
Storage and Retrieval for Image and Video Databases (SPIE) 1995: 352-362 |
| 126 | EE | Leonidas J. Guibas,
David H. Marimont:
Rounding Arrangements Dynamically.
Symposium on Computational Geometry 1995: 190-199 |
| 125 | | Bernard Chazelle,
Herbert Edelsbrunner,
Michelangelo Grigni,
Leonidas J. Guibas,
Micha Sharir,
Emo Welzl:
Improved Bounds on Weak epsilon-Nets for Convex Sets.
Discrete & Computational Geometry 13: 1-15 (1995) |
| 124 | | Leonidas J. Guibas,
Dan Halperin,
Jirí Matousek,
Micha Sharir:
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
Discrete & Computational Geometry 14(2): 113-122 (1995) |
| 123 | EE | Mark de Berg,
Leonidas J. Guibas,
Dan Halperin,
Mark H. Overmars,
Otfried Schwarzkopf,
Micha Sharir,
Monique Teillaud:
Reaching a Goal with Directional Uncertainty.
Theor. Comput. Sci. 140(2): 301-317 (1995) |
| 1994 |
|---|
| 122 | | Leonidas J. Guibas:
The Design and Analysis of Geometric Algorithms.
IFIP Congress (1) 1994: 211-212 |
| 121 | EE | Mark de Berg,
Leonidas J. Guibas,
Dan Halperin:
Vertical Decompositions for Triangles in 3-Space.
Symposium on Computational Geometry 1994: 1-10 |
| 120 | EE | Leonidas J. Guibas,
John Hershberger:
Morphing Simple Polygons.
Symposium on Computational Geometry 1994: 267-276 |
| 119 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains.
Algorithmica 11(2): 116-132 (1994) |
| 118 | | Bernard Chazelle,
Herbert Edelsbrunner,
Michelangelo Grigni,
Leonidas J. Guibas,
John Hershberger,
Micha Sharir,
Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations.
Algorithmica 12(1): 54-68 (1994) |
| 117 | | Tetsuo Asano,
Leonidas J. Guibas,
Takeshi Tokuyama:
Walking on an arrangement topologically.
Int. J. Comput. Geometry Appl. 4(2): 123-151 (1994) |
| 116 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
Raimund Seidel,
Micha Sharir:
Selecting Heavily Covered Points.
SIAM J. Comput. 23(6): 1138-1151 (1994) |
| 1993 |
|---|
| 115 | | Leonidas J. Guibas,
Dan Halperin,
Jirí Matousek,
Micha Sharir:
On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
CCCG 1993: 127-132 |
| 114 | | Prosenjit Bose,
Leonidas J. Guibas,
Anna Lubiw,
Mark H. Overmars,
Diane L. Souvaine,
Jorge Urrutia:
The Floodlight Problem.
CCCG 1993: 399-404 |
| 113 | | Mark de Berg,
Mark H. Overmars,
Leonidas J. Guibas,
Otfried Schwarzkopf,
Monique Teillaud,
Dan Halperin,
Micha Sharir:
Reaching a Goal with Directional Uncertainty.
ISAAC 1993: 1-10 |
| 112 | EE | Bernard Chazelle,
Herbert Edelsbrunner,
Michelangelo Grigni,
Leonidas J. Guibas,
Micha Sharir,
Emo Welzl:
Improved bounds on weak epsilon-nets for convex sets.
STOC 1993: 495-504 |
| 111 | | David P. Dobkin,
Leonidas J. Guibas,
John Hershberger,
Jack Snoeyink:
An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon.
Algorithmica 10(1): 1-23 (1993) |
| 110 | | Leonidas J. Guibas,
David Salesin,
Jorge Stolfi:
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives.
Algorithmica 9(6): 534-560 (1993) |
| 109 | | Feng Gao,
Leonidas J. Guibas,
David G. Kirkpatrick,
William T. Laaser,
James B. Saxe:
Finding Extrema with Unary Predicates.
Algorithmica 9(6): 591-600 (1993) |
| 108 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
Diameter, Width, Closest Line Pair, and Parametric Searching.
Discrete & Computational Geometry 10: 183-196 (1993) |
| 107 | | Leonidas J. Guibas,
John Hershberger,
Joseph S. B. Mitchell,
Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths.
Int. J. Comput. Geometry Appl. 3(4): 383-415 (1993) |
| 106 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir,
Jack Snoeyink:
Computing a Face in an Arrangement of Line Segments and Related Problems.
SIAM J. Comput. 22(6): 1286-1302 (1993) |
| 1992 |
|---|
| 105 | EE | Leonidas J. Guibas,
Rajeev Motwani,
Prabhakar Raghavan:
The Robot Localization Problem in Two Dimensions.
SODA 1992: 259-268 |
| 104 | EE | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
Diameter, Width, Closest Line Pair, and Parametric Searching.
Symposium on Computational Geometry 1992: 120-129 |
| 103 | | Leonidas J. Guibas,
Donald E. Knuth,
Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
Algorithmica 7(4): 381-413 (1992) |
| 102 | | Boris Aronov,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
The number of edges of many faces in a line segment arrangement.
Combinatorica 12(3): 261-274 (1992) |
| 101 | | Michael J. Fischer,
Nancy D. Griffeth,
Leonidas J. Guibas,
Nancy A. Lynch:
Optimal Placement of Identical Resources in a Tree
Inf. Comput. 96(1): 1-54 (1992) |
| 100 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.
Theor. Comput. Sci. 92(2): 319-336 (1992) |
| 1991 |
|---|
| 99 | | Bernard Chazelle,
Herbert Edelsbrunner,
Michelangelo Grigni,
Leonidas J. Guibas,
John Hershberger,
Micha Sharir,
Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations.
ICALP 1991: 661-646 |
| 98 | | Leonidas J. Guibas,
John Hershberger,
Joseph S. B. Mitchell,
Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths.
ISA 1991: 151-162 |
| 97 | | Leonidas J. Guibas:
Combinatorics and Algorithms of Geometric Arrangements.
ISA 1991: 218 |
| 96 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir,
Jack Snoeyink:
Computing a Face in an Arrangement of Line Segments.
SODA 1991: 441-448 |
| 95 | EE | Tetsuo Asano,
Leonidas J. Guibas,
Takeshi Tokuyama:
Walking on an Arrangement Topologically.
Symposium on Computational Geometry 1991: 297-306 |
| 94 | | Leonidas J. Guibas,
Joseph S. B. Mitchell:
Voronoi Diagrams of Moving Points in the Plane.
WG 1991: 113-125 |
| 93 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space.
Comput. Geom. 1: 305-323 (1991) |
| 92 | | Leonidas J. Guibas,
John Hershberger,
Jack Snoeyink:
Compact interval trees: a data structure for convex hulls.
Int. J. Comput. Geometry Appl. 1(1): 1-22 (1991) |
| 91 | | Herbert Edelsbrunner,
Leonidas J. Guibas:
Corrigendum: Topologically Sweeping an Arrangement.
J. Comput. Syst. Sci. 42(2): 249-251 (1991) |
| 90 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications.
Theor. Comput. Sci. 84(1): 77-105 (1991) |
| 1990 |
|---|
| 89 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space
FOCS 1990: 242-251 |
| 88 | | Leonidas J. Guibas,
Donald E. Knuth,
Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
ICALP 1990: 414-431 |
| 87 | | Leonidas J. Guibas,
David Salesin,
Jorge Stolfi:
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives.
SIGAL International Symposium on Algorithms 1990: 261-270 |
| 86 | | Efthymios Anagnostou,
Vassilios G. Polimenis,
Leonidas J. Guibas:
Topological Sweeping in Three Dimensions.
SIGAL International Symposium on Algorithms 1990: 310-317 |
| 85 | | Leonidas J. Guibas,
John Hershberger,
Jack Snoeyink:
Compact Interval Trees: A Data Structure for Convex Hulls.
SODA 1990: 169-178 |
| 84 | EE | Boris Aronov,
Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir,
Rephael Wenger:
Points and Triangles in the Plane and Halving Planes in Space.
Symposium on Computational Geometry 1990: 112-115 |
| 83 | EE | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
Raimund Seidel,
Micha Sharir:
Slimming Down by Adding: Selecting Heavily Covered Points.
Symposium on Computational Geometry 1990: 116-127 |
| 82 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments.
Discrete & Computational Geometry 5: 161-196 (1990) |
| 81 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
The Complexity of Many Cells in Arrangements of Planes and Related Problems.
Discrete & Computational Geometry 5: 197-216 (1990) |
| 80 | | Kenneth L. Clarkson,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir,
Emo Welzl:
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.
Discrete & Computational Geometry 5: 99-160 (1990) |
| 1989 |
|---|
| 79 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.
ICALP 1989: 179-193 |
| 78 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
Lines in Space-Combinatorics, Algorithms and Applications
STOC 1989: 382-393 |
| 77 | EE | David Salesin,
Jorge Stolfi,
Leonidas J. Guibas:
Epsilon Geometry: Building Robust Algorithms from Imprecise Computations.
Symposium on Computational Geometry 1989: 208-217 |
| 76 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas:
The Complexity of Cutting Complexes.
Discrete & Computational Geometry 4: 139-181 (1989) |
| 75 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
Discrete & Computational Geometry 4: 311-336 (1989) |
| 74 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink,
Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments.
Discrete & Computational Geometry 4: 433-466 (1989) |
| 73 | | Leonidas J. Guibas,
Micha Sharir,
Shmuel Sifrony:
On the General Motion-Planning Problem with Two Degrees of Freedom.
Discrete & Computational Geometry 4: 491-521 (1989) |
| 72 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
On Arrangement of Jordan Arcs with Three Intersection per Pair.
Discrete & Computational Geometry 4: 523-539 (1989) |
| 71 | | Bernard Chazelle,
Leonidas J. Guibas:
Visibility and Intersection Problems in Plane Geometry.
Discrete & Computational Geometry 4: 551-581 (1989) |
| 70 | | Alok Aggarwal,
Leonidas J. Guibas,
James B. Saxe,
Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
Discrete & Computational Geometry 4: 591-604 (1989) |
| 69 | | Herbert Edelsbrunner,
Leonidas J. Guibas:
Topologically Sweeping an Arrangement.
J. Comput. Syst. Sci. 38(1): 165-194 (1989) |
| 68 | | Leonidas J. Guibas,
John Hershberger:
Optimal Shortest Path Queries in a Simple Polygon.
J. Comput. Syst. Sci. 39(2): 126-152 (1989) |
| 1988 |
|---|
| 67 | | Kenneth L. Clarkson,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir,
Emo Welzl:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces
FOCS 1988: 568-579 |
| 66 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.
ICALP 1988: 214-229 |
| 65 | EE | David P. Dobkin,
Leonidas J. Guibas,
John Hershberger,
Jack Snoeyink:
An efficient algorithm for finding the CSG representation of a simple polygon.
SIGGRAPH 1988: 31-40 |
| 64 | | Leonidas J. Guibas,
Mark H. Overmars,
Micha Sharir:
Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques.
SWAT 1988: 64-73 |
| 63 | EE | Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
On Arrangements of Jordan Arcs with Three Intersections per Pair.
Symposium on Computational Geometry 1988: 258-265 |
| 62 | EE | Leonidas J. Guibas,
Micha Sharir,
Shmuel Sifrony:
On the General Motion Planning Problem with Two Degrees of Freedom.
Symposium on Computational Geometry 1988: 289-298 |
| 61 | EE | Herbert Edelsbrunner,
Leonidas J. Guibas,
Micha Sharir:
The Complexity of Many Faces in Arrangements of Lines of Segments.
Symposium on Computational Geometry 1988: 44-55 |
| 60 | EE | Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink,
Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments.
Symposium on Computational Geometry 1988: 56-69 |
| 59 | | Alok Aggarwal,
Bernard Chazelle,
Leonidas J. Guibas,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Parallel Computational Geometry.
Algorithmica 3: 293-327 (1988) |
| 58 | | John Hershberger,
Leonidas J. Guibas:
An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body.
J. Algorithms 9(1): 18-46 (1988) |
| 1987 |
|---|
| 57 | | Alok Aggarwal,
Leonidas J. Guibas,
James B. Saxe,
Peter W. Shor:
A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon
STOC 1987: 39-45 |
| 56 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas:
The Complexity of Cutting Convex Polytopes
STOC 1987: 66-76 |
| 55 | EE | Leonidas J. Guibas,
John Hershberger:
Optimal Shortest Path Queries in a Simple Polygon.
Symposium on Computational Geometry 1987: 50-63 |
| 54 | | Leonidas J. Guibas,
John Hershberger,
Daniel Leven,
Micha Sharir,
Robert Endre Tarjan:
Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.
Algorithmica 2: 209-233 (1987) |
| 53 | | Leonidas J. Guibas,
Raimund Seidel:
Computing Convolutions by Reciprocal Search.
Discrete & Computational Geometry 2: 175-193 (1987) |
| 52 | | Leonidas J. Guibas,
Jorge Stolfi,
Kenneth L. Clarkson:
Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time.
Theor. Comput. Sci. 49: 81-84 (1987) |
| 1986 |
|---|
| 51 | | Herbert Edelsbrunner,
Leonidas J. Guibas:
Topologically Sweeping an Arrangement
STOC 1986: 389-403 |
| 50 | EE | Leonidas J. Guibas,
John Hershberger,
Daniel Leven,
Micha Sharir,
Robert Endre Tarjan:
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons.
Symposium on Computational Geometry 1986: 1-13 |
| 49 | EE | Leonidas J. Guibas,
Raimund Seidel:
Computing Convolutions by Reciprocal Search.
Symposium on Computational Geometry 1986: 90-99 |
| 48 | | Takao Asano,
Tetsuo Asano,
Leonidas J. Guibas,
John Hershberger,
Hiroshi Imai:
Visibility of Disjoint Polygons.
Algorithmica 1(1): 49-63 (1986) |
| 47 | | Bernard Chazelle,
Leonidas J. Guibas:
Fractional Cascading: I. A Data Structuring Technique.
Algorithmica 1(2): 133-162 (1986) |
| 46 | | Bernard Chazelle,
Leonidas J. Guibas:
Fractional Cascading: II. Applications.
Algorithmica 1(2): 163-191 (1986) |
| 45 | | Nancy A. Lynch,
Nancy D. Griffeth,
Michael J. Fischer,
Leonidas J. Guibas:
Probabilistic Analysis of a Network Resource Allocation Algorithm
Information and Control 68(1-3): 47-85 (1986) |
| 44 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
Jorge Stolfi:
Optimal Point Location in a Monotone Subdivision.
SIAM J. Comput. 15(2): 317-340 (1986) |
| 1985 |
|---|
| 43 | | Takao Asano,
Tetsuo Asano,
Leonidas J. Guibas,
John Hershberger,
Hiroshi Imai:
Visibility-Polygon Search and Euclidean Shortest Paths
FOCS 1985: 155-164 |
| 42 | | Alok Aggarwal,
Bernard Chazelle,
Leonidas J. Guibas,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Parallel Computational Geometry (Extended Abstract)
FOCS 1985: 468-477 |
| 41 | | Bernard Chazelle,
Leonidas J. Guibas:
Fractional Cascading: A Data Structuring Technique with Geometric Applications.
ICALP 1985: 90-100 |
| 40 | EE | Leonidas J. Guibas,
Jorge Stolfi:
Primitives for the Manipulation of General Subdivisions and Computation of Voronoi Diagrams.
ACM Trans. Graph. 4(2): 74-123 (1985) |
| 39 | | Bernard Chazelle,
Leonidas J. Guibas,
D. T. Lee:
The Power of Geometric Duality.
BIT 25(1): 76-90 (1985) |
| 38 | | Leonidas J. Guibas,
John Hershberger:
Computing the visibility graphs of n line segments in O(nn) time.
Bulletin of the EATCS 26: 13-20 (1985) |
| 37 | | Leonidas J. Guibas:
Problems.
J. Algorithms 6(2): 283-290 (1985) |
| 36 | | James E. Boyce,
David P. Dobkin,
Robert L. (Scot) Drysdale III,
Leonidas J. Guibas:
Finding Extremal Polygons.
SIAM J. Comput. 14(1): 134-147 (1985) |
| 1984 |
|---|
| 35 | EE | A. Robin Forrest,
Leonidas J. Guibas,
Jürg Nievergelt:
Guest Editor's Introduction to Special Issue on Computational Geometry.
ACM Trans. Graph. 3(4): 241-243 (1984) |
| 34 | | Leonidas J. Guibas:
Problems.
J. Algorithms 5(1): 145-146 (1984) |
| 33 | | Leonidas J. Guibas:
Problems.
J. Algorithms 5(4): 579-594 (1984) |
| 1983 |
|---|
| 32 | | Leonidas J. Guibas,
Lyle Ramshaw,
Jorge Stolfi:
A Kinetic Framework for Computational Geometry
FOCS 1983: 100-111 |
| 31 | | Bernard Chazelle,
Leonidas J. Guibas,
D. T. Lee:
The Power of Geometric Duality
FOCS 1983: 217-225 |
| 30 | | Leonidas J. Guibas,
Jorge Stolfi:
Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams
STOC 1983: 221-234 |
| 29 | | Leonidas J. Guibas,
Jorge Stolfi:
On Computing All North-East Nearest Neighbors in the L1 Metric.
Inf. Process. Lett. 17(4): 219-223 (1983) |
| 28 | | Leonidas J. Guibas:
Problems.
J. Algorithms 4(1): 85-86 (1983) |
| 27 | | Leonidas J. Guibas:
Problems.
J. Algorithms 4(2): 176-188 (1983) |
| 26 | | Leonidas J. Guibas:
Problems.
J. Algorithms 4(4): 382-396 (1983) |
| 1982 |
|---|
| 25 | | James E. Boyce,
David P. Dobkin,
Robert L. (Scot) Drysdale III,
Leonidas J. Guibas:
Finding Extremal Polygons
STOC 1982: 282-289 |
| 24 | EE | Leonidas J. Guibas,
Jorge Stolfi:
A Language for Bitmap Manipulation.
ACM Trans. Graph. 1(3): 191-214 (1982) |
| 23 | | Leonidas J. Guibas:
Problems.
J. Algorithms 3(2): 177-181 (1982) |
| 22 | | Leonidas J. Guibas:
Problems.
J. Algorithms 3(4): 362-380 (1982) |
| 1981 |
|---|
| 21 | | Michael J. Fischer,
Leonidas J. Guibas,
Nancy D. Griffeth,
Nancy A. Lynch:
Optimal Placement of Identical Resources in a Distributed Network.
ICDCS 1981: 324-336 |
| 20 | | Allan Borodin,
Leonidas J. Guibas,
Nancy A. Lynch,
Andrew Chi-Chih Yao:
Efficient Searching Using Partial Ordering.
Inf. Process. Lett. 12(2): 71-75 (1981) |
| 19 | | Leonidas J. Guibas:
Problems.
J. Algorithms 2(1): 103-104 (1981) |
| 18 | | Leonidas J. Guibas:
Problems.
J. Algorithms 2(2): 208-210 (1981) |
| 17 | | Leonidas J. Guibas:
Problems.
J. Algorithms 2(3): 314-315 (1981) |
| 16 | | Leonidas J. Guibas,
Andrew M. Odlyzko:
Periods in Strings.
J. Comb. Theory, Ser. A 30(1): 19-42 (1981) |
| 15 | | Leonidas J. Guibas,
Andrew M. Odlyzko:
String Overlaps, Pattern Matching, and Nontransitive Games.
J. Comb. Theory, Ser. A 30(2): 183-208 (1981) |
| 1980 |
|---|
| 14 | | Leonidas J. Guibas,
F. Frances Yao:
On Translating a Set of Rectangles
STOC 1980: 154-160 |
| 13 | | Leonidas J. Guibas:
Problems.
J. Algorithms 1(1): 107-110 (1980) |
| 12 | | Leonidas J. Guibas:
Problems.
J. Algorithms 1(2): 209-212 (1980) |
| 11 | | Leonidas J. Guibas:
Problems.
J. Algorithms 1(4): 394-395 (1980) |
| 10 | | Leonidas J. Guibas,
Andrew M. Odlyzko:
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm.
SIAM J. Comput. 9(4): 672-682 (1980) |
| 1978 |
|---|
| 9 | | Leonidas J. Guibas,
Robert Sedgewick:
A Dichromatic Framework for Balanced Trees
FOCS 1978: 8-21 |
| 8 | | Leonidas J. Guibas,
Douglas K. Wyatt:
Compilation and Delayed Evaluation in APL.
POPL 1978: 1-8 |
| 7 | EE | Leonidas J. Guibas:
The Analysis of Hashing Techniques That Exhibit k-ary Clustering.
J. ACM 25(4): 544-555 (1978) |
| 6 | | Leonidas J. Guibas,
Endre Szemerédi:
The Analysis of Double Hashing.
J. Comput. Syst. Sci. 16(2): 226-274 (1978) |
| 1977 |
|---|
| 5 | | Leonidas J. Guibas,
Andrew M. Odlyzko:
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
FOCS 1977: 189-195 |
| 4 | | Leonidas J. Guibas,
Edward M. McCreight,
Michael F. Plass,
Janet R. Roberts:
A New Representation for Linear Lists
STOC 1977: 49-60 |
| 1976 |
|---|
| 3 | | Leonidas J. Guibas:
The Analysis of Hashing Algorithms that Exhibit k-ary Clustering
FOCS 1976: 183-196 |
| 2 | | Leonidas J. Guibas,
Endre Szemerédi:
The Analysis of Double Hashing (Extended Abstract)
STOC 1976: 187-191 |
| 1974 |
|---|
| 1 | | Leonidas J. Guibas:
A Principle of Independence for Binary Tree Searching
Acta Inf. 4: 293-298 (1974) |
