 | 2009 |
|---|
| 199 |       | Joseph S. B. Mitchell:
Algorithmic Problems in Air Traffic Management.
ALENEX 2009: 62 |
| 198 | | Joondong Kim,
Alexander Kroeller,
Joseph S. B. Mitchell:
Scheduling Aircraft to Reduce Controller Workload.
ATMOS 2009 |
| 197 | | Sándor P. Fekete,
Joseph S. B. Mitchell,
Christiane Schmidt:
Minimum Covering with Travel Cost.
ISAAC 2009: 393-402 |
| 196 | | Joseph S. B. Mitchell,
Eli Packer:
Reconstructing sharp features of triangular meshes.
Symposium on Computational Geometry 2009: 102-103 |
| 195 | | Bernardo M. Ábrego,
Esther M. Arkin,
Silvia Fernández-Merchant,
Ferran Hurtado,
Mikio Kano,
Joseph S. B. Mitchell,
Jorge Urrutia:
Matching Points with Squares.
Discrete & Computational Geometry 41(1): 77-95 (2009) |
| 194 | | Esther M. Arkin,
Sang Won Bae,
Alon Efrat,
Kazuya Okamoto,
Joseph S. B. Mitchell,
Valentin Polishchuk:
Geometric stable roommates.
Inf. Process. Lett. 109(4): 219-224 (2009) |
| 193 | | Sven Koenig,
Joseph S. B. Mitchell,
Apurva Mudgal,
Craig A. Tovey:
A Near-Tight Approximation Algorithm for the Robot Localization Problem.
SIAM J. Comput. 39(2): 461-490 (2009) |
| 2008 |
|---|
| 192 | | Amitabh Basu,
Joseph S. B. Mitchell,
Girishkumar Sabhnani:
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing.
ALENEX 2008: 75-89 |
| 191 |  | Esther M. Arkin,
George Hart,
Joondong Kim,
Irina Kostitsyna,
Joseph S. B. Mitchell,
Girishkumar Sabhnani,
Steven Skiena:
The Embroidery Problem.
CCCG 2008 |
| 190 | | Alon Efrat,
Sándor P. Fekete,
Poornananda R. Gaddehosur,
Joseph S. B. Mitchell,
Valentin Polishchuk,
Jukka Suomela:
Improved Approximation Algorithms for Relay Placement.
ESA 2008: 356-367 |
| 189 | | Xianjin Zhu,
Rik Sarkar,
Jie Gao,
Joseph S. B. Mitchell:
Light-Weight Contour Tracking in Wireless Sensor Networks.
INFOCOM 2008: 1175-1183 |
| 188 | | 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 |
| 187 | | Marc J. van Kreveld,
Maarten Löffler,
Joseph S. B. Mitchell:
Preprocessing Imprecise Points and Splitting Triangulations.
ISAAC 2008: 544-555 |
| 186 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Valentin Polishchuk:
Maximum thick paths in static and dynamic environments.
Symposium on Computational Geometry 2008: 20-27 |
| 185 | | Joondong Kim,
Joseph S. B. Mitchell,
Valentin Polishchuk,
Arto Vihavainen:
Routing a maximum number of disks through a scene of moving obstacles.
Symposium on Computational Geometry 2008: 230-231 |
| 184 | | Iris Reinbacher,
Marc Benkert,
Marc J. van Kreveld,
Joseph S. B. Mitchell,
Jack Snoeyink,
Alexander Wolff:
Delineating Boundaries for Imprecise Regions.
Algorithmica 50(3): 386-414 (2008) |
| 183 | | Marc J. van Kreveld,
Joseph S. B. Mitchell,
Peter Rousseeuw,
Micha Sharir,
Jack Snoeyink,
Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth.
Discrete & Computational Geometry 39(4): 656-677 (2008) |
| 182 | | Joseph S. B. Mitchell,
Valentin Polishchuk:
Minimum-perimeter enclosures.
Inf. Process. Lett. 107(3-4): 120-124 (2008) |
| 181 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Jack Snoeyink:
Capturing crossings: Convex hulls of segment and plane intersections.
Inf. Process. Lett. 107(5): 194-197 (2008) |
| 180 | | Martin Held,
Joseph S. B. Mitchell:
Triangulating input-constrained planar point sets.
Inf. Process. Lett. 109(1): 54-56 (2008) |
| 2007 |
|---|
| 179 | | Yoav Amit,
Joseph S. B. Mitchell,
Eli Packer:
Locating Guards for Visibility Coverage of Polygons.
ALENEX 2007 |
| 178 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections.
CCCG 2007: 9-11 |
| 177 | | Joseph S. B. Mitchell:
A PTAS for TSP with neighborhoods among fat regions in the plane.
SODA 2007: 11-18 |
| 176 | | Valentin Polishchuk,
Joseph S. B. Mitchell:
Thick non-crossing paths and minimum-cost flows in polygonal domains.
Symposium on Computational Geometry 2007: 56-65 |
| 175 | | Peter Braß,
Eowyn Cenek,
Christian A. Duncan,
Alon Efrat,
Cesim Erten,
Dan Ismailescu,
Stephen G. Kobourov,
Anna Lubiw,
Joseph S. B. Mitchell:
On simultaneous planar graph embeddings.
Comput. Geom. 36(2): 117-130 (2007) |
| 174 | | Ferran Hurtado,
Joseph S. B. Mitchell:
Editorial.
Comput. Geom. 37(1): 1-2 (2007) |
| 173 | | Joseph S. B. Mitchell:
Guest Editor's Foreword.
Discrete & Computational Geometry 37(1): 1-2 (2007) |
| 172 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Valentin Polishchuk:
Two New Classes of Hamiltonian Graphs: (Extended Abstract).
Electronic Notes in Discrete Mathematics 29: 565-569 (2007) |
| 171 | | Boaz Ben-Moshe,
Matthew J. Katz,
Joseph S. B. Mitchell:
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding.
SIAM J. Comput. 36(6): 1631-1647 (2007) |
| 2006 |
|---|
| 170 | | Valentin Polishchuk,
Esther M. Arkin,
Joseph S. B. Mitchell:
Hamiltonian Cycles in Triangular Grids.
CCCG 2006 |
| 169 | | Yue Wang,
Jie Gao,
Joseph S. B. Mitchell:
Boundary recognition in sensor networks by topological methods.
MOBICOM 2006: 122-133 |
| 168 | | Amitabh Basu,
Jie Gao,
Joseph S. B. Mitchell,
Girishkumar Sabhnani:
Distributed localization using noisy distance and angle information.
MobiHoc 2006: 262-273 |
| 167 | | Olaf Hall-Holt,
Matthew J. Katz,
Piyush Kumar,
Joseph S. B. Mitchell,
Arik Sityon:
Finding large sticks and potatoes in polygons.
SODA 2006: 474-483 |
| 166 | | Helmut Alt,
Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
Kim Whittlesey:
Minimum-cost coverage of point sets by disks.
Symposium on Computational Geometry 2006: 449-458 |
| 165 | | Esther M. Arkin,
Gill Barequet,
Joseph S. B. Mitchell:
Algorithms for two-box covering.
Symposium on Computational Geometry 2006: 459-467 |
| 164 | | Ovidiu Daescu,
Joseph S. B. Mitchell,
Simeon C. Ntafos,
James D. Palmer,
Chee-Keng Yap:
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.
Symposium on Computational Geometry 2006: 483-484 |
| 163 | | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and unlocked chains of planar shapes.
Symposium on Computational Geometry 2006: 61-70 |
| 162 | | Ovidiu Daescu,
Joseph S. B. Mitchell,
Simeon C. Ntafos,
James D. Palmer,
Chee-Keng Yap:
An Experimental Study of Weighted k-Link Shortest Path Algorithms.
WAFR 2006: 187-202 |
| 161 | | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Valentin Polishchuk:
The Snowblower Problem.
WAFR 2006: 219-234 |
| 160 | | Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.
Algorithmica 46(2): 193-221 (2006) |
| 159 | | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Valentin Polishchuk:
The Snowblower Problem
CoRR abs/cs/0603026: (2006) |
| 158 | | Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
Kim Whittlesey:
Minimum-Cost Coverage of Point Sets by Disks
CoRR abs/cs/0604008: (2006) |
| 157 | | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and Unlocked Chains of Planar Shapes
CoRR abs/cs/0604022: (2006) |
| 156 | | Paz Carmi,
Matthew J. Katz,
Joseph S. B. Mitchell:
The minimum-area spanning tree problem.
Comput. Geom. 35(3): 218-225 (2006) |
| 155 | | Esther M. Arkin,
Ferran Hurtado,
Joseph S. B. Mitchell,
Carlos Seara,
Steven Skiena:
Some Lower Bounds on Geometric Separability Problems.
Int. J. Comput. Geometry Appl. 16(1): 1-26 (2006) |
| 2005 |
|---|
| 154 | | Joseph S. B. Mitchell,
Günter Rote:
Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005
ACM 2005 |
| 153 | | Alon Efrat,
Sariel Har-Peled,
Joseph S. B. Mitchell:
Approximation algorithms for location problems in sensor networks.
BROADNETS 2005: 767-776 |
| 152 | | Valentin Polishchuk,
Joseph S. B. Mitchell:
k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane.
CCCG 2005: 101-104 |
| 151 | | Valentin Polishchuk,
Joseph S. B. Mitchell:
Touring Convex Bodies - A Conic Programming Solution.
CCCG 2005: 290-293 |
| 150 | | Iris Reinbacher,
Marc Benkert,
Marc J. van Kreveld,
Joseph S. B. Mitchell,
Alexander Wolff:
Delineating Boundaries for Imprecise Regions.
ESA 2005: 143-154 |
| 149 | | Boaz Ben-Moshe,
Matthew J. Katz,
Joseph S. B. Mitchell:
A constant-factor approximation algorithm for optimal terrain guarding.
SODA 2005: 515-524 |
| 148 | | Paz Carmi,
Matthew J. Katz,
Joseph S. B. Mitchell:
The Minimum-Area Spanning Tree Problem.
WADS 2005: 195-204 |
| 147 | | Ovidiu Daescu,
Joseph S. B. Mitchell,
Simeon C. Ntafos,
James D. Palmer,
Chee-Keng Yap:
k-Link Shortest Paths in Weighted Subdivisions.
WADS 2005: 325-337 |
| 146 | | Matthew J. Katz,
Joseph S. B. Mitchell,
Yuval Nir:
Orthogonal segment stabbing.
Comput. Geom. 30(2): 197-205 (2005) |
| 145 | | Sándor P. Fekete,
Joseph S. B. Mitchell,
Karin Beurer:
On the Continuous Fermat-Weber Problem.
Operations Research 53(1): 61-76 (2005) |
| 144 | | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal Covering Tours with Turn Costs.
SIAM J. Comput. 35(3): 531-566 (2005) |
| 2004 |
|---|
| 143 | | Erik D. Demaine,
Satyan L. Devadoss,
Joseph S. B. Mitchell,
Joseph O'Rourke:
Continuous foldability of polygonal paper.
CCCG 2004: 64-67 |
| 142 | | Bernardo M. Ábrego,
Esther M. Arkin,
Silvia Fernández-Merchant,
Ferran Hurtado,
Mikio Kano,
Joseph S. B. Mitchell,
Jorge Urrutia:
Matching Points with Circles and Squares.
JCDCG 2004: 1-15 |
| 141 | | Joseph S. B. Mitchell,
Micha Sharir:
New results on shortest paths in three dimensions.
Symposium on Computational Geometry 2004: 124-133 |
| 140 | | Boaz Ben-Moshe,
Olaf Hall-Holt,
Matthew J. Katz,
Joseph S. B. Mitchell:
Computing the visibility graph of points within a polygon.
Symposium on Computational Geometry 2004: 27-35 |
| 139 | | Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
CoRR cs.DS/0402045: (2004) |
| 138 | | Boaz Ben-Moshe,
Matthew J. Katz,
Joseph S. B. Mitchell,
Yuval Nir:
Visibility preserving terrain simplification-- an experimental study.
Comput. Geom. 28(2-3): 175-190 (2004) |
| 137 | | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When can you fold a map?
Comput. Geom. 29(1): 23-46 (2004) |
| 136 | | Adrian Dumitrescu,
Joseph S. B. Mitchell,
Micha Sharir:
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.
Discrete & Computational Geometry 31(2): 207-227 (2004) |
| 135 | | D. T. Lee,
Joseph S. B. Mitchell:
A note from the editors-in-chief.
Int. J. Comput. Geometry Appl. 14(1-2): (2004) |
| 134 | | Joseph S. B. Mitchell:
Editor's foreword.
Int. J. Comput. Geometry Appl. 14(4-5): 231-232 (2004) |
| 2003 |
|---|
| 133 | | Piyush Kumar,
Joseph S. B. Mitchell,
E. Alper Yildirim:
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions.
ALENEX 2003: 45-55 |
| 132 | | Moshe Dror,
Alon Efrat,
Anna Lubiw,
Joseph S. B. Mitchell:
Touring a sequence of polygons.
STOC 2003: 473-482 |
| 131 | | Tien-Ruey Hsiang,
Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell:
Online dispersion algorithms for swarms of robots.
Symposium on Computational Geometry 2003: 382-383 |
| 130 | | Peter Braß,
Eowyn Cenek,
Christian A. Duncan,
Alon Efrat,
Cesim Erten,
Dan Ismailescu,
Stephen G. Kobourov,
Anna Lubiw,
Joseph S. B. Mitchell:
On Simultaneous Planar Graph Embeddings.
WADS 2003: 243-255 |
| 129 | | Piyush Kumar,
Joseph S. B. Mitchell,
E. Alper Yildirim:
Approximate minimum enclosing balls in high dimensions using core-sets.
ACM Journal of Experimental Algorithmics 8: (2003) |
| 128 | | Sándor P. Fekete,
Joseph S. B. Mitchell,
Karin Beurer:
On the continuous Fermat-Weber problem
CoRR cs.CG/0310027: (2003) |
| 127 | | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal Covering Tours with Turn Costs
CoRR cs.DS/0309014: (2003) |
| 126 | | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
An algorithmic study of manufacturing paperclips and other folded structures.
Comput. Geom. 25(1-2): 117-138 (2003) |
| 125 | | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Steven Skiena:
The Lazy Bureaucrat scheduling problem.
Inf. Comput. 184(1): 129-146 (2003) |
| 124 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Christine D. Piatko:
Minimum-link watchman tours.
Inf. Process. Lett. 86(4): 203-207 (2003) |
| 123 | | Adrian Dumitrescu,
Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane.
J. Algorithms 48(1): 135-159 (2003) |
| 2002 |
|---|
| 122 | | Vitus J. Leung,
Esther M. Arkin,
Michael A. Bender,
David P. Bunde,
Jeanette Johnston,
Alok Lal,
Joseph S. B. Mitchell,
Cynthia A. Phillips,
Steven S. Seiden:
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
CLUSTER 2002: 296-304 |
| 121 | | Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Martin Skutella:
The freeze-tag problem: how to wake up a swarm of robots.
SODA 2002: 568-577 |
| 120 | | Marcelo O. Sztainberg,
Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell:
Analysis of Heuristics for the Freeze-Tag Problem.
SWAT 2002: 270-279 |
| 119 | | Christos Levcopoulos,
Andrzej Lingas,
Joseph S. B. Mitchell:
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
SWAT 2002: 80-89 |
| 118 | | Regina Estkowski,
Joseph S. B. Mitchell,
Xinyu Xiang:
Optimal decomposition of polygonal models into triangle strips.
Symposium on Computational Geometry 2002: 254-263 |
| 117 | | Boaz Ben-Moshe,
Joseph S. B. Mitchell,
Matthew J. Katz,
Yuval Nir:
Visibility preserving terrain simplification: an experimental study.
Symposium on Computational Geometry 2002: 303-311 |
| 116 | | Christian A. Duncan,
Alon Efrat,
Cesim Erten,
Stephen G. Kobourov,
Joseph S. B. Mitchell:
On Simultaneous Graph Embedding
CoRR cs.CG/0206018: (2002) |
| 115 | | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures
CoRR cs.CG/0209034: (2002) |
| 114 | | Esther M. Arkin,
Sándor P. Fekete,
Ferran Hurtado,
Joseph S. B. Mitchell,
Marc Noy,
Vera Sacristan,
Saurabh Sethia:
On the Reflexivity of Point Sets
CoRR cs.CG/0210003: (2002) |
| 113 | | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Steven Skiena:
The Lazy Bureaucrat Scheduling Problem
CoRR cs.DS/0210024: (2002) |
| 112 | | Tien-Ruey Hsiang,
Esther M. Arkin,
Michael A. Bender,
Sándor P. Fekete,
Joseph S. B. Mitchell:
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments
CoRR cs.RO/0212022: (2002) |
| 111 | | 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) |
| 110 | | Ora Arbell,
Gad M. Landau,
Joseph S. B. Mitchell:
Edit distance of run-length encoded strings.
Inf. Process. Lett. 83(6): 307-314 (2002) |
| 2001 |
|---|
| 109 | | Saurabh Sethia,
Martin Held,
Joseph S. B. Mitchell:
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets.
ALENEX 2001: 105-116 |
| 108 | | Erik D. Demaine,
Joseph S. B. Mitchell:
Reaching folded states of a rectangular piece of paper.
CCCG 2001: 73-75 |
| 107 | | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Sándor P. Fekete,
Joseph S. B. Mitchell,
Saurabh Sethia:
Optimal covering tours with turn costs.
SODA 2001: 138-147 |
| 106 | | Adrian Dumitrescu,
Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane.
SODA 2001: 38-46 |
| 105 | | Adrian Dumitrescu,
Joseph S. B. Mitchell,
Micha Sharir:
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles.
Symposium on Computational Geometry 2001: 141-150 |
| 104 | | Boaz Ben-Moshe,
Matthew J. Katz,
Joseph S. B. Mitchell:
Farthest neighbors and center points in the presence of rectangular obstacles.
Symposium on Computational Geometry 2001: 164-171 |
| 103 | | Regina Estkowski,
Joseph S. B. Mitchell:
Simplifying a polygonal subdivision while keeping it simple.
Symposium on Computational Geometry 2001: 40-49 |
| 102 | | Esther M. Arkin,
Sándor P. Fekete,
Ferran Hurtado,
Joseph S. B. Mitchell,
Marc Noy,
Vera Sacristan,
Saurabh Sethia:
On the Reflexivity of Point Sets.
WADS 2001: 192-204 |
| 101 | | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When Can You Fold a Map?
WADS 2001: 401-413 |
| 100 | | Joseph S. B. Mitchell,
Joseph O'Rourke:
Computational Geometry Column 42
CoRR cs.CG/0108021: (2001) |
| 99 | | Ferran Hurtado,
Joseph S. B. Mitchell,
Marc Noy:
Foreword.
Discrete Applied Mathematics 109(1-2): 1 (2001) |
| 98 | | Joseph S. B. Mitchell,
Joseph O'Rourke:
Computational Geometry Column 42.
Int. J. Comput. Geometry Appl. 11(5): 573-582 (2001) |
| 97 | | Sándor P. Fekete,
Joseph S. B. Mitchell:
Terrain Decomposition and Layered Manufacturing.
Int. J. Comput. Geometry Appl. 11(6): 647-668 (2001) |
| 96 | | Joseph S. B. Mitchell,
Joseph O'Rourke:
Computational geometry.
SIGACT News 32(3): 63-72 (2001) |
| 2000 |
|---|
| 95 | | Esther M. Arkin,
Ferran Hurtado,
Joseph S. B. Mitchell,
Carlos Seara,
Steven Skiena:
Some Separability Problems in the Plane.
EuroCG 2000: 51-54 |
| 94 | | Ricardo C. Farias,
Joseph S. B. Mitchell,
Cláudio T. Silva,
Brian N. Wylie:
Time-Critical Rendering of Irregular Grids.
SIBGRAPI 2000: 243-250 |
| 93 | | 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 |
| 92 | | Sándor P. Fekete,
Joseph S. B. Mitchell,
Karin Weinbrecht:
On the continuous Weber and k-median problems (extended abstract).
Symposium on Computational Geometry 2000: 70-79 |
| 91 | | Ricardo C. Farias,
Joseph S. B. Mitchell,
Cláudio T. Silva:
ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering.
Volviz 2000: 91-99 |
| 90 | | Esther M. Arkin,
Michael A. Bender,
Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell,
Saurabh Sethia,
Steven Skiena:
When Can You Fold a Map?
CoRR cs.CG/0011026: (2000) |
| 89 | | Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell:
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami.
Comput. Geom. 16(1): 3-21 (2000) |
| 88 | | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
Approximation algorithms for lawn mowing and milling.
Comput. Geom. 17(1-2): 25-50 (2000) |
| 87 | | Shakhar Smorodinsky,
Joseph S. B. Mitchell,
Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd.
Discrete & Computational Geometry 23(2): 247-259 (2000) |
| 1999 |
|---|
| 86 | | Xinyu Xiang,
Martin Held,
Joseph S. B. Mitchell:
Fast and effective stripification of polygonal surface models.
SI3D 1999: 71-78 |
| 85 | | Yi-Jen Chiang,
Joseph S. B. Mitchell:
Two-Point Euclidean Shortest Path Queries in the Plane.
SODA 1999: 215-224 |
| 84 | | Xinyu Xiang,
Martin Held,
Joseph S. B. Mitchell:
Fast and Effective Stripification of Polygonal Surface Models.
SODA 1999: 985-986 |
| 83 | | Erik D. Demaine,
Martin L. Demaine,
Joseph S. B. Mitchell:
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami.
Symposium on Computational Geometry 1999: 105-114 |
| 82 | | Marc J. van Kreveld,
Joseph S. B. Mitchell,
Peter Rousseeuw,
Micha Sharir,
Jack Snoeyink,
Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth.
Symposium on Computational Geometry 1999: 31-40 |
| 81 | | Shakhar Smorodinsky,
Joseph S. B. Mitchell,
Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd.
Symposium on Computational Geometry 1999: 400-406 |
| 80 | | Esther M. Arkin,
Michael A. Bender,
Joseph S. B. Mitchell,
Steven Skiena:
The Lazy Bureaucrat Scheduling Problem.
WADS 1999: 122-133 |
| 79 | | João Comba,
James T. Klosowski,
Nelson L. Max,
Joseph S. B. Mitchell,
Cláudio T. Silva,
Peter L. Williams:
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids.
Comput. Graph. Forum 18(3): 369-376 (1999) |
| 78 | | Michael T. Goodrich,
Joseph S. B. Mitchell,
Mark W. Orletsky:
Approximate Geometric Pattern Matching Under Rigid Motions.
IEEE Trans. Pattern Anal. Mach. Intell. 21(4): 371-379 (1999) |
| 77 | | Joseph S. B. Mitchell:
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems.
SIAM J. Comput. 28(4): 1298-1309 (1999) |
| 76 | | Esther M. Arkin,
Yi-Jen Chiang,
Joseph S. B. Mitchell,
Steven Skiena,
Tae-Cheon Yang:
On the Maximum Scatter Traveling Salesperson Problem.
SIAM J. Comput. 29(2): 515-544 (1999) |
| 1998 |
|---|
| 75 | | Cláudio T. Silva,
Joseph S. B. Mitchell:
Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm.
ACM-GIS 1998: 137-144 |
| 74 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Giri Narasimhan:
Resource-Constrained Geometric Network Optimization.
Symposium on Computational Geometry 1998: 307-316 |
| 73 | | Cláudio T. Silva,
Joseph S. B. Mitchell,
Peter L. Williams:
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes.
VVS 1998: 87-94 |
| 72 | | Esther M. Arkin,
Yi-Jen Chiang,
Martin Held,
Joseph S. B. Mitchell,
Vera Sacristan,
Steven Skiena,
Tae-Heng Yang:
On Minimum-Area Hulls.
Algorithmica 21(1): 119-136 (1998) |
| 71 | | Esther M. Arkin,
Martin Held,
Joseph S. B. Mitchell,
Steven Skiena:
Recognizing polygonal parts from width measurements.
Comput. Geom. 9(4): 237-246 (1998) |
| 70 | | James T. Klosowski,
Martin Held,
Joseph S. B. Mitchell,
Henry Sowizral,
Karel Zikan:
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs.
IEEE Trans. Vis. Comput. Graph. 4(1): 21-36 (1998) |
| 69 | | Esther M. Arkin,
Henk Meijer,
Joseph S. B. Mitchell,
David Rappaport,
Steven Skiena:
Decision trees for geometric models.
Int. J. Comput. Geometry Appl. 8(3): 343-364 (1998) |
| 68 | | 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) |
| 67 | | Arie Tamir,
Joseph S. B. Mitchell:
A maximum b-matching problem arising from median location models with applications to the roommates problem.
Math. Program. 80: 171-194 (1998) |
| 66 | | Joseph S. B. Mitchell,
Avrim Blum,
Prasad Chalasani,
Santosh Vempala:
A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane.
SIAM J. Comput. 28(3): 771-781 (1998) |
| 1997 |
|---|
| 65 | | Esther M. Arkin,
Yi-Jen Chiang,
Joseph S. B. Mitchell,
Steven Skiena,
Tae-Cheon Yang:
On the Maximum Scatter TSP (Extended Abstract).
SODA 1997: 211-220 |
| 64 | | Cristian S. Mata,
Joseph S. B. Mitchell:
A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract).
Symposium on Computational Geometry 1997: 264-273 |
| 63 | | George N. Sazaklis,
Esther M. Arkin,
Joseph S. B. Mitchell,
Steven Skiena:
Geometric Decision Trees for Optical Character Recognition (Extended Abstract).
Symposium on Computational Geometry 1997: 394-396 |
| 62 | | Esther M. Arkin,
Patrice Belleville,
Joseph S. B. Mitchell,
David M. Mount,
Kathleen Romanik,
Steven Salzberg,
Diane L. Souvaine:
Testing Simple Polygons.
Comput. Geom. 8: 97-114 (1997) |
| 61 | | Sanjiv Kapoor,
S. N. Maheshwari,
Joseph S. B. Mitchell:
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.
Discrete & Computational Geometry 18(4): 377-383 (1997) |
| 60 | | Cláudio T. Silva,
Joseph S. B. Mitchell:
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids.
IEEE Trans. Vis. Comput. Graph. 3(2): 142-157 (1997) |
| 59 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Steven Skiena:
Guest Editors' Foreword.
Int. J. Comput. Geometry Appl. 7(1/2): 1- (1997) |
| 58 | | Joseph S. B. Mitchell,
David M. Mount,
Subhash Suri:
Query-Sensitive Ray Shooting.
Int. J. Comput. Geometry Appl. 7(4): 317-347 (1997) |
| 1996 |
|---|
| 57 | | Esther M. Arkin,
Yi-Jen Chiang,
Martin Held,
Joseph S. B. Mitchell,
Vera Sacristan,
Steven Skiena,
Tae-Heng Yang:
On Minimum-Area Hulls (Extended Abstract).
ESA 1996: 334-348 |
| 56 | | Joseph S. B. Mitchell:
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem.
SODA 1996: 402-408 |
| 55 | | Martin Held,
James T. Klosowski,
Joseph S. B. Mitchell:
Collision Detection for Fly-Throughs in Virtual Environments.
Symposium on Computational Geometry 1996: V-13-V-14 |
| 54 | | Cláudio T. Silva,
Joseph S. B. Mitchell,
Arie E. Kaufman:
Fast Rendering of Irregular Grids.
VVS 1996: 15- |
| 53 | | Joseph S. B. Mitchell:
On Some Applications of Computational Geometry in Manufacturing and Virtual Environments.
WACG 1996: 37-40 |
| 52 | | Zhu Chong,
Gopalakrishnan Sundaram,
Jack Snoeyink,
Joseph S. B. Mitchell:
Generating Random Polygons with Given Vertices.
Comput. Geom. 6: 277-290 (1996) |
| 51 | | 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) |
| 50 | | Joseph S. B. Mitchell:
Shortest paths among obstacles in the plane.
Int. J. Comput. Geometry Appl. 6(3): 309-332 (1996) |
| 49 | | Esther M. Arkin,
Martin Held,
Joseph S. B. Mitchell,
Steven Skiena:
Hamiltonian triangulations for fast rendering.
The Visual Computer 12(9): 429-444 (1996) |
| 1995 |
|---|
| 48 | | Cláudio T. Silva,
Joseph S. B. Mitchell,
Arie E. Kaufman:
Automatic Generation of Triangular Irregular Networks Using Greedy Cuts.
IEEE Visualization 1995: 201-208 |
| 47 | | Cristian S. Mata,
Joseph S. B. Mitchell:
Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract).
Symposium on Computational Geometry 1995: 360-369 |
| 46 | | Joseph S. B. Mitchell,
Subhash Suri:
Separation and Approximation of Polyhedral Objects.
Comput. Geom. 5: 95-114 (1995) |
| 45 | | Esther M. Arkin,
Dan Halperin,
Klara Kedem,
Joseph S. B. Mitchell,
Nir Naor:
Arrangements of Segments that Share Endpoints Single Face Results.
Discrete & Computational Geometry 13: 257-270 (1995) |
| 44 | | Joseph S. B. Mitchell,
Günter Rote,
Gopalakrishnan Sundaram,
Gerhard J. Woeginger:
Counting Convex Polygons in Planar Point Sets.
Inf. Process. Lett. 56(1): 45-49 (1995) |
| 43 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Subhash Suri:
Logarithmic-time link path queries in a simple polygon.
Int. J. Comput. Geometry Appl. 5(4): 369-395 (1995) |
| 42 | | Paul J. Heffernan,
Joseph S. B. Mitchell:
An Optimal Algorithm for Computing Visibility in the Plane.
SIAM J. Comput. 24(1): 184-201 (1995) |
| 1994 |
|---|
| 41 | | Chong Zhu,
Gopalakrishnan Sundaram,
Jack Snoeyink,
Joseph S. B. Mitchell:
Generating Random x-Monotone Polygons with Given Vertices.
CCCG 1994: 189-194 |
| 40 | | Esther M. Arkin,
Martin Held,
Joseph S. B. Mitchell,
Steven Skiena:
Hamilton Triangulations for Fast Rendering.
ESA 1994: 36-47 |
| 39 | | Michael T. Goodrich,
Joseph S. B. Mitchell,
Mark W. Orletsky:
Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version).
Symposium on Computational Geometry 1994: 103-112 |
| 38 | | Joseph S. B. Mitchell,
David M. Mount,
Subhash Suri:
Query-Sensitive Ray Shooting.
Symposium on Computational Geometry 1994: 359-368 |
| 1993 |
|---|
| 37 | | Erik L. Wynters,
Joseph S. B. Mitchell:
Shortest Paths for a Two-robot Rendez-vous.
CCCG 1993: 216-221 |
| 36 | | Esther M. Arkin,
Patrice Belleville,
Joseph S. B. Mitchell,
David M. Mount,
Kathleen Romanik,
Steven Salzberg,
Diane L. Souvaine:
Testing Simple Polygons.
CCCG 1993: 387 |
| 35 | | Esther M. Arkin,
Sándor P. Fekete,
Joseph S. B. Mitchell:
The Lawnmower Problem.
CCCG 1993: 461-466 |
| 34 | | Joseph S. B. Mitchell:
Shortest Paths Among Obstacles in the Plane.
Symposium on Computational Geometry 1993: 308-317 |
| 33 | | Esther M. Arkin,
Henk Meijer,
Joseph S. B. Mitchell,
David Rappaport,
Steven Skiena:
Decision Trees for Geometric Models.
Symposium on Computational Geometry 1993: 369-378 |
| 32 | | Esther M. Arkin,
Michael T. Goodrich,
Joseph S. B. Mitchell,
David M. Mount,
Christine D. Piatko,
Steven Skiena:
Point Probe Decision Trees for Geometric Concept Classes.
WADS 1993: 95-106 |
| 31 | | Esther M. Arkin,
Samir Khuller,
Joseph S. B. Mitchell:
Geometric Knapsack Problems.
Algorithmica 10(5): 399-427 (1993) |
| 30 | | 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) |
| 1992 |
|---|
| 29 | | Joseph S. B. Mitchell,
Christine D. Piatko,
Esther M. Arkin:
Computing a Shortest k-Link Path in a Polygon
FOCS 1992: 573-582 |
| 28 | | Esther M. Arkin,
Joseph S. B. Mitchell,
Subhash Suri:
Optimal Link Path Queries in a Simple Polygon.
SODA 1992: 269-279 |
| 27 | | Joseph S. B. Mitchell,
Subhash Suri:
Separation and Approximation of Polyhedral Objects.
SODA 1992: 296-306 |
| 26 | | Joseph S. B. Mitchell:
L_1 Shortest Paths Among Polygonal Obstacles in the Plane.
Algorithmica 8(1): 55-88 (1992) |
| 25 | | Joseph S. B. Mitchell,
Günter Rote,
Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plan.
Algorithmica 8(5&6): 431-459 (1992) |
| 24 | | Joseph S. B. Mitchell,
Jan Karel Lenstra:
Guest Editors' Introduction.
INFORMS Journal on Computing 4(4): 357-359 (1992) |
| 23 | | Esther M. Arkin,
Klara Kedem,
Joseph S. B. Mitchell,
Josef Sprinzak,
Michael Werman:
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms.
INFORMS Journal on Computing 4(4): 375-386 (1992) |
| 1991 |
|---|
| 22 | | Leonidas J. Guibas,
John Hershberger,
Joseph S. B. Mitchell,
Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths.
ISA 1991: 151-162 |
| 21 | | Esther M. Arkin,
Klara Kedem,
Joseph S. B. Mitchell,
Josef Sprinzak,
Michael Werman:
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms.
SODA 1991: 42-51 |
| 20 | | Esther M. Arkin,
Dan Halperin,
Klara Kedem,
Joseph S. B. Mitchell,
Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results.
Symposium on Computational Geometry 1991: 324-333 |
| 19 | | Esther M. Arkin,
Samir Khuller,
Joseph S. B. Mitchell:
Geometric Knapsack Problems.
WADS 1991: 165-176 |
| 18 | | Joseph S. B. Mitchell,
Erik L. Wynters:
Finding Optimal Bipartitions of Points and Polygons.
WADS 1991: 202-213 |
| 17 | | Paul J. Heffernan,
Joseph S. B. Mitchell:
An Optimal Algorithm for Computing Visibility in the Plane.
WADS 1991: 437-448 |
| 16 | | Leonidas J. Guibas,
Joseph S. B. Mitchell:
Voronoi Diagrams of Moving Points in the Plane.
WG 1991: 113-125 |
| 15 | | Joseph S. B. Mitchell:
A New Algorithm for Shortest Paths Among Obstacles in the Plane.
Ann. Math. Artif. Intell. 3(1): 83-105 (1991) |
| 14 | | Esther M. Arkin,
L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes.
IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 209-216 (1991) |
| 13 | | Joseph S. B. Mitchell,
Christos H. Papadimitriou:
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision.
J. ACM 38(1): 18-73 (1991) |
| 1990 |
|---|
| 12 | | Esther M. Arkin,
L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes.
SODA 1990: 129-137 |
| 11 | | Paul J. Heffernan,
Joseph S. B. Mitchell:
Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract).
Symposium on Computational Geometry 1990: 53-62 |
| 10 | | Joseph S. B. Mitchell,
Günter Rote,
Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plane.
Symposium on Computational Geometry 1990: 63-72 |
| 9 | | Laxmi Gewali,
Alex C. Meng,
Joseph S. B. Mitchell,
Simeon C. Ntafos:
Path Planning in 0/1/ Weighted Regions with Applications.
INFORMS Journal on Computing 2(3): 253-272 (1990) |
| 8 | | Samir Khuller,
Joseph S. B. Mitchell:
On a Triangle Counting Problem.
Inf. Process. Lett. 33(6): 319-321 (1990) |
| 7 | | Joseph S. B. Mitchell:
On Maximum Flows in Polyhedral Domains.
J. Comput. Syst. Sci. 40(1): 88-123 (1990) |
| 1989 |
|---|
| 6 | | Esther M. Arkin,
Robert Connelly,
Joseph S. B. Mitchell:
On Monotone Paths Among Obstacles with Applications to Planning Assemblies.
Symposium on Computational Geometry 1989: 334-343 |
| 1988 |
|---|
| 5 | | Laxmi Gewali,
Alex C. Meng,
Joseph S. B. Mitchell,
Simeon C. Ntafos:
Path Planning in 0/1/infinity Weighted Regions with Applications.
Symposium on Computational Geometry 1988: 266-278 |
| 4 | | Joseph S. B. Mitchell:
On Maximum Flows in Polyhedral Domains.
Symposium on Computational Geometry 1988: 341-351 |
| 3 | | Joseph S. B. Mitchell:
An Algorithmic Approach to Some Problems in Terrain Navigation.
Artif. Intell. 37(1-3): 171-201 (1988) |
| 1987 |
|---|
| 2 | | Joseph S. B. Mitchell,
Christos H. Papadimitriou:
The Weighted Region Problem.
Symposium on Computational Geometry 1987: 30-38 |
| 1 | | Joseph S. B. Mitchell,
David M. Mount,
Christos H. Papadimitriou:
The Discrete Geodesic Problem.
SIAM J. Comput. 16(4): 647-668 (1987) |
