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