- Fast and Effective Stripification of Polygonal Surface Models Xinyu Xiang Martin Held y Joseph S. B. Mitchell z
- Binary Space Partitions for AxisParallel Segments, Rectangles, and Hyperrectangles
- k-Link Shortest Paths in Weighted Subdivisions Ovidiu Daescu1
- Geometric Shortest Paths and Network Optimization Joseph S.B. Mitchell \Lambda
- Touring a Sequence of Polygons The University of Arizona
- An Optimal Algorithm for L1 Shortest Paths Among Obstacles in the Plane
- Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks
- Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in IR d
- Maximum Thick Paths in Static and Dynamic Environments Esther M. Arkin
- Optimal Decomposition of Polygonal Models into Triangle Strips #
- Guillotine subdivisions approximate polygonal subdivisions: Part III --Faster polynomialtime approximation schemes for
- Guillotine Subdivisions Approximate Polygonal Subdivisions
- Shortest Paths for a Two-Robot Rendez-Vous Erik L. Wynters Joseph S. B. Mitchell
- Evaluation of Collision Detection Methods for Virtual Reality FlyThroughs \Lambda
- A Constant-Factor Approximation Algorithm for Optimal Terrain Guarding
- New Results on Shortest Paths in Three Dimensions Joseph S. B. Mitchell
- Approximation Algorithms for Two Optimal Location Problems in Sensor Networks
- Approximation algorithms for TSP with neighborhoods in the plane
- Guillotine Subdivisions Approximate Polygonal Subdivisions
- Recognizing Polygonal Parts from Width Measurements Esther M. Arkin (1) \Lambda Martin Held (1);(2) y
- Guest Editor's Introduction Special Issue of Algorithmica on
- Generating Random Polygons with Given Vertices Chong Zhu 1 Gopalakrishnan Sundaram 2 Jack Snoeyink 3;5 Joseph S. B. Mitchell 4;6
- Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
- Approximate Geometric Pattern Matching under Rigid Motions Michael T. Goodrich
- An E cient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
- Some Lower Bounds on Geometric Separability Problems Esther M. Arkin
- Fast Rendering of Irregular Grids Claudio T. Silva Joseph S. B. Mitchell Arie E. Kaufman
- Minimum-Cost Coverage of Point Sets by Disks Freie Universitt Berlin
- When Can You Fold a Map? Esther M. Arkin Michael A. Bender y Erik D. Demaine z Martin L. Demaine z
- [WACG'96:0] On Some Applications of
- Computational Geometry Problems in the Real (and Virtual) World Joe Mitchell
- Finding Optimal Bipartitions of Points and Polygons \Lambda Joseph S. B. Mitchell y
- Separation and Approximation of Polyhedral Objects Joseph S. B. Mitchell 3 Subhash Suri y
- The Freeze-Tag Problem: How to Wake Up a Swarm of Robots Esther M. Arkin
- Separation and Approximation of Polyhedral Objects Joseph S. B. Mitchell
- Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
- A Constant-Factor Approximation Algorithm for TSP with Neighborhoods in the Plane
- Thick Non-Crossing Paths and Minimum-Cost Flows in Polygonal Domains
- Sweeping Simple Polygons with a Chain of Guards Alon Efrat Leonidas J. Guibas y Sariel Har-Peled z David C. Lin x
- Farthest Neighbors and Center Points in the Presence of Rectangular Obstacles
- Orthogonal Segment Stabbing Matthew J. Katz1
- Routing a Maximum Number of Disks through a Scene of Moving Obstacles
- Locating Guards for Visibility Coverage of Polygons Joseph S. B. Mitchell
- A PTAS for TSP with Neighborhoods Among Fat Regions in the Plane Joseph S. B. Mitchell
- Boundary Recognition in Sensor Networks by Topological Methods
- Distributed Localization Using Noisy Distance and Angle Information
- Jimmy Krozel is with Metron Aviation, Inc., Herndon, VA. Changkil Lee and Joseph S.B. Mitchell are with Stony Brook University, Stony Brook, NY.
- Algorithms for Two-Box Covering Esther M. Arkin
- Computing the Visibility Graph of Points Within a Polygon Boaz Ben-Moshe
- Improved Approximation Algorithms for the Freeze-Tag Problem
- Visibility Preserving Terrain Simplification --An Experimental Study
- A Geometric Shortest Path Problem, with Application to Computing a Longest Common Subsequence in Run-Length
- Geometric Algorithms for Conflict Detection/Resolution in Air Traffic Management1
- A MAXIMUM b-MATCHING PROBLEM ARISING FROM MEDIAN LOCATION MODELS WITH APPLICATIONS TO
- Approximation Algorithms for Geometric Separation Problems Joseph S. B. Mitchell
- 28] U. Ramer. An iterative procedure for the polygonal approximation of plane curves. Computer Vision, Graphics, and Image Processing, 1:244{256, 1972.
- Minimum-Link Watchman Tours Esther M. Arkin
- Bicriteria Shortest Path Problems in the Plane (extended abstract)
- An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures
- On the Existence of Small Faces in Arrangements of Lines Joseph S. B. Mitchell
- Matching Points into PairwiseDisjoint Noise Regions: Combinatorial Bounds and Algorithms
- Simplifying a Polygonal Subdivision While Keeping it Simple
- Optimal Covering Tours with Turn Costs Esther M. Arkin Michael A. Bender y Erik D. Demaine z Sandor P. Fekete x
- BOXTREE: A Hierarchical Representation for Surfaces in 3D
- Efficient Collision Detection Using Bounding Volume Hierarchies of kDOPs \Lambda
- A CONSTANTFACTOR APPROXIMATION ALGORITHM FOR THE GEOMETRIC KMST PROBLEM IN THE PLANE
- The Minimum-Area Spanning Tree Problem , Matthew J. Katz1
- Approximate Minimum Enclosing Balls in High Dimensions Using Core-Sets
- The Snowblower Problem Esther M. Arkin1
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- Optimal Decomposition of Polygonal Models into Triangle Strips
