Joseph S. B. Mitchell

According to our database1, Joseph S. B. Mitchell authored at least 248 papers between 1987 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization.
CoRR, 2020

Planar Bichromatic Bottleneck Spanning Trees.
CoRR, 2020

Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020.
CoRR, 2020

Data Inference from Encrypted Databases: A Multi-dimensional Order-Preserving Matching Approach.
CoRR, 2020

Probing a Set of Trajectories to Maximize Captured Information.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Packing and Covering with Segments.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Computing β-Stretch Paths in Drawings of Graphs.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019
Locating battery charging stations to facilitate almost shortest paths.
Discret. Appl. Math., 2019

Existence and hardness of conveyor belts.
CoRR, 2019

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains.
Algorithmica, 2019

Minimum Membership Covering and Hitting.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Optimizing Sensor Deployment With Line-Of-Sight Constraints: Theory and Practice.
Proceedings of the 2019 International Conference on Embedded Wireless Systems and Networks, 2019

New Results on a Family of Geometric Hitting Set Problems in the Plane.
Proceedings of the Combinatorial Optimization and Applications, 2019

The Balanced Connected Subgraph Problem.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.
Proceedings of the Approximation, 2019

2018
Geometric Hitting Set for Segments of Few Orientations.
Theory Comput. Syst., 2018

Universal Guard Problems.
Int. J. Comput. Geom. Appl., 2018

Selecting and covering colored points.
Discret. Appl. Math., 2018

Connecting a set of circles with minimum sum of radii.
Comput. Geom., 2018

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Secure communication through jammers jointly optimized in geography and time.
Pervasive Mob. Comput., 2017

Computing nonsimple polygons of minimum perimeter.
JoCG, 2017

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Discret. Comput. Geom., 2017

An algorithm for the maximum weight independent set problem on outerstring graphs.
Comput. Geom., 2017

Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity.
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017

Network Optimization on Partitioned Pairs of Points.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

TSP With Locational Uncertainty: The Adversarial Model.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Approximation Schemes for Geometric Network Optimization Problems.
Encyclopedia of Algorithms, 2016

Improved Approximation Algorithms for Relay Placement.
ACM Trans. Algorithms, 2016

Shortest path to a segment and quickest visibility queries.
JoCG, 2016

The Shortest Separating Cycle Problem.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Approximation Algorithms for Time-Window TSP and Prize Collecting TSP Problems.
Proceedings of the Algorithmic Foundations of Robotics XII, 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Combinatorics, algorithms and systems for sensor deployment with line-of-sight constraints: poster.
Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2016

2015
The minimum backlog problem.
Theor. Comput. Sci., 2015

Bichromatic 2-center of pairs of points.
Comput. Geom., 2015

Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions.
Comput. Geom., 2015

Optimizing Read Reversals for Sequence Compression - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Choice Is Hard.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Optimal placement of protective jammers for securing wireless transmissions in a geographic domain.
Proceedings of the 14th International Conference on Information Processing in Sensor Networks, 2015

An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Conflict-free Covering.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Picture-Hanging Puzzles.
Theory Comput. Syst., 2014

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014

The Minimum Guarding Tree Problem.
Discrete Math., Alg. and Appl., 2014

Minimum-link paths revisited.
Comput. Geom., 2014

Watchman routes for lines and line segments.
Comput. Geom., 2014

Convex transversals.
Comput. Geom., 2014

Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks.
Ad Hoc Networks, 2014

Bounded stretch geographic homotopic routing in sensor networks.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013
Local Redesigning of Airspace Sectors
CoRR, 2013

Beacon-Based Algorithms for Geometric Routing.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Approximating Watchman Routes.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Open Problems from CCCG 2012.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Combinatorics of Beacon Routing and Coverage.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Minimum covering with travel cost.
J. Comb. Optim., 2012

The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices.
Inf. Process. Lett., 2012

Separability of Point Sets by k-Level Linear Classification Trees.
Int. J. Comput. Geom. Appl., 2012

Optimizing restriction site placement for synthetic genomes.
Inf. Comput., 2012

The Art Gallery Theorem for Polyominoes.
Discret. Comput. Geom., 2012

Routing multi-class traffic flows in the plane.
Comput. Geom., 2012

Watchman Routes for Lines and Segments.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Efficient algorithms for pursuing moving evaders in terrains.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Invited talk: Computational Geometry in Air Traffic Management.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
The snowblower problem.
Comput. Geom., 2011

Spiral Serpentine Polygonization of a Planar Point Set.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Distributed localization and clustering using data correlation and the Occam's razor principle.
Proceedings of the Distributed Computing in Sensor Systems, 2011

Guarding polyominoes.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Exploring and Triangulating a Region by a Swarm of Robots.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Preprocessing Imprecise Points and Splitting Triangulations.
SIAM J. Comput., 2010

Locating Guards for Visibility Coverage of Polygons.
Int. J. Comput. Geom. Appl., 2010

Locked and Unlocked Chains of Planar Shapes.
Discret. Comput. Geom., 2010

Maximum thick paths in static and dynamic environments.
Comput. Geom., 2010

Data transmission and base-station placement for optimizing network lifetime.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
A Near-Tight Approximation Algorithm for the Robot Localization Problem.
SIAM J. Comput., 2009

Geometric algorithms for optimal airspace design and air traffic controller workload balancing.
ACM J. Exp. Algorithmics, 2009

Geometric stable roommates.
Inf. Process. Lett., 2009

Matching Points with Squares.
Discret. Comput. Geom., 2009

Not being (super)thin or solid is hard: A study of grid Hamiltonicity.
Comput. Geom., 2009

Open Problem Session.
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009

Reconstructing sharp features of triangular meshes.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Approximating Maximum Flow in Polygonal Domains using Spanners.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Scheduling Aircraft to Reduce Controller Workload.
Proceedings of the ATMOS 2009, 2009

Algorithmic Problems in Air Traffic Management.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Minimum-perimeter enclosures.
Inf. Process. Lett., 2008

Triangulating input-constrained planar point sets.
Inf. Process. Lett., 2008

Capturing crossings: Convex hulls of segment and plane intersections.
Inf. Process. Lett., 2008

Efficient Algorithms for Maximum Regression Depth.
Discret. Comput. Geom., 2008

Delineating Boundaries for Imprecise Regions.
Algorithmica, 2008

Light-Weight Contour Tracking in Wireless Sensor Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

On Finding Large Empty Convex Bodies in 3D Scenes of Polygonal Models.
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

Improved Approximation Algorithms for Relay Placement.
Proceedings of the Algorithms, 2008

Routing a maximum number of disks through a scene of moving obstacles.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

The Embroidery Problem.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding.
SIAM J. Comput., 2007

Two New Classes of Hamiltonian Graphs: (Extended Abstract).
Electron. Notes Discret. Math., 2007

Guest Editor's Foreword.
Discret. Comput. Geom., 2007

Editorial.
Comput. Geom., 2007

On simultaneous planar graph embeddings.
Comput. Geom., 2007

A PTAS for TSP with neighborhoods among fat regions in the plane.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Thick non-crossing paths and minimum-cost flows in polygonal domains.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Some Lower Bounds on Geometric Separability Problems.
Int. J. Comput. Geom. Appl., 2006

Minimum-Cost Coverage of Point Sets by Disks
CoRR, 2006

The minimum-area spanning tree problem.
Comput. Geom., 2006

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.
Algorithmica, 2006

An Experimental Study of Weighted k-Link Shortest Path Algorithms.
Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Finding large sticks and potatoes in polygons.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Distributed localization using noisy distance and angle information.
Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

Boundary recognition in sensor networks by topological methods.
Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, 2006

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Algorithms for two-box covering.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Hamiltonian Cycles in Triangular Grids.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Optimal Covering Tours with Turn Costs.
SIAM J. Comput., 2005

On the Continuous Fermat-Weber Problem.
Oper. Res., 2005

Orthogonal segment stabbing.
Comput. Geom., 2005

k-Link Shortest Paths in Weighted Subdivisions.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

A constant-factor approximation algorithm for optimal terrain guarding.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Delineating Boundaries for Imprecise Regions.
Proceedings of the Algorithms, 2005

Touring Convex Bodies - A Conic Programming Solution.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Approximation algorithms for location problems in sensor networks.
Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005

2004
Shortest Paths and Networks.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem.
IEEE Trans. Robotics, 2004

Editor's foreword.
Int. J. Comput. Geom. Appl., 2004

A note from the editors-in-chief.
Int. J. Comput. Geom. Appl., 2004

Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.
Discret. Comput. Geom., 2004

Visibility preserving terrain simplification-- an experimental study.
Comput. Geom., 2004

When can you fold a map?
Comput. Geom., 2004

Matching Points with Circles and Squares.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

New results on shortest paths in three dimensions.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Computing the visibility graph of points within a polygon.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Continuous foldability of polygonal paper.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Approximate minimum enclosing balls in high dimensions using core-sets.
ACM J. Exp. Algorithmics, 2003

Approximation algorithms for TSP with neighborhoods in the plane.
J. Algorithms, 2003

Minimum-link watchman tours.
Inf. Process. Lett., 2003

The Lazy Bureaucrat scheduling problem.
Inf. Comput., 2003

An algorithmic study of manufacturing paperclips and other folded structures.
Comput. Geom., 2003

Touring a sequence of polygons.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Online dispersion algorithms for swarms of robots.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
Edit distance of run-length encoded strings.
Inf. Process. Lett., 2002

New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping.
Discret. Comput. Geom., 2002

On Simultaneous Graph Embedding
CoRR, 2002

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments.
Proceedings of the Algorithmic Foundations of Robotics V, 2002

Analysis of Heuristics for the Freeze-Tag Problem.
Proceedings of the Algorithm Theory, 2002

Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
Proceedings of the Algorithm Theory, 2002

The freeze-tag problem: how to wake up a swarm of robots.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Optimal decomposition of polygonal models into triangle strips.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002

2001
Computational geometry.
SIGACT News, 2001

Computational Geometry Column 42.
Int. J. Comput. Geom. Appl., 2001

Terrain Decomposition and Layered Manufacturing.
Int. J. Comput. Geom. Appl., 2001

Foreword.
Discret. Appl. Math., 2001

On the Reflexivity of Point Sets.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Simplifying a polygonal subdivision while keeping it simple.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Farthest neighbors and center points in the presence of rectangular obstacles.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Reaching folded states of a rectangular piece of paper.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd.
Discret. Comput. Geom., 2000

Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami.
Comput. Geom., 2000

Approximation algorithms for lawn mowing and milling.
Comput. Geom., 2000

ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering.
Proceedings of the Proceeding of the 2000 Volume Visualization and Graphics Symposium, 2000

Sweeping simple polygons with a chain of guards.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Time-Critical Rendering of Irregular Grids.
Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000), 2000

Some Separability Problems in the Plane.
EuroCG, 2000

On the continuous Weber and k-median problems (extended abstract).
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Geometric Shortest Paths and Network Optimization.
Proceedings of the Handbook of Computational Geometry, 2000

1999
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems.
SIAM J. Comput., 1999

On the Maximum Scatter Traveling Salesperson Problem.
SIAM J. Comput., 1999

Approximate Geometric Pattern Matching Under Rigid Motions.
IEEE Trans. Pattern Anal. Mach. Intell., 1999

Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids.
Comput. Graph. Forum, 1999

Fast and Effective Stripification of Polygonal Surface Models.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Two-Point Euclidean Shortest Path Queries in the Plane.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs.
IEEE Trans. Vis. Comput. Graph., 1998

A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane.
SIAM J. Comput., 1998

A maximum b-matching problem arising from median location models with applications to the roommates problem.
Math. Program., 1998

Decision trees for geometric models.
Int. J. Comput. Geom. Appl., 1998

Voronoi Diagrams of Moving Points.
Int. J. Comput. Geom. Appl., 1998

Recognizing polygonal parts from width measurements.
Comput. Geom., 1998

On Minimum-Area Hulls.
Algorithmica, 1998

An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes.
Proceedings of the Proceeding of the 1998 IEEE Symposium on Volume Visualization, 1998

Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm.
Proceedings of the ACM-GIS '98, 1998

Resource-Constrained Geometric Network Optimization.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids.
IEEE Trans. Vis. Comput. Graph., 1997

Query-Sensitive Ray Shooting.
Int. J. Comput. Geom. Appl., 1997

Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 1997

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.
Discret. Comput. Geom., 1997

Testing Simple Polygons.
Comput. Geom., 1997

On the Maximum Scatter TSP (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Geometric Decision Trees for Optical Character Recognition (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Hamiltonian triangulations for fast rendering.
Vis. Comput., 1996

Shortest paths among obstacles in the plane.
Int. J. Comput. Geom. Appl., 1996

Generating Random Polygons with Given Vertices.
Comput. Geom., 1996

BOXTREE: A Hierarchical Representation for Surfaces in 3D.
Comput. Graph. Forum, 1996

On Some Applications of Computational Geometry in Manufacturing and Virtual Environments.
Proceedings of the Applied Computational Geormetry, 1996

Fast Rendering of Irregular Grids.
Proceedings of the Proceeding of the 1996 Symposium on Volume Visualization, 1996

Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Real-time collision detection for motion simulation within complex environments.
Proceedings of the ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH 1996, 1996

On Minimum-Area Hulls (Extended Abstract).
Proceedings of the Algorithms, 1996

Collision Detection for Fly-Throughs in Virtual Environments.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
An Optimal Algorithm for Computing Visibility in the Plane.
SIAM J. Comput., 1995

Counting Convex Polygons in Planar Point Sets.
Inf. Process. Lett., 1995

Logarithmic-time link path queries in a simple polygon.
Int. J. Comput. Geom. Appl., 1995

Arrangements of Segments that Share Endpoints Single Face Results.
Discret. Comput. Geom., 1995

Separation and Approximation of Polyhedral Objects.
Comput. Geom., 1995

Automatic Generation of Triangular Irregular Networks Using Greedy Cuts.
Proceedings of the IEEE Visualization '95, Proceedings, Atlanta, Georgia, USA, October 29, 1995

Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract).
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Hamilton Triangulations for Fast Rendering.
Proceedings of the Algorithms, 1994

Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Generating Random x-Monotone Polygons with Given Vertices.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Approximating Polygons and Subdivisions with Minimum Link Paths.
Int. J. Comput. Geom. Appl., 1993

Geometric Knapsack Problems.
Algorithmica, 1993

Point Probe Decision Trees for Geometric Concept Classes.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Shortest Paths for a Two-robot Rendez-vous.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

The Lawnmower Problem.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Guest Editors' Introduction.
INFORMS J. Comput., 1992

Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms.
INFORMS J. Comput., 1992

Minimum-Link Paths Among Obstacles in the Plan.
Algorithmica, 1992

L_1 Shortest Paths Among Polygonal Obstacles in the Plane.
Algorithmica, 1992

Optimal Link Path Queries in a Simple Polygon.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Computing a Shortest k-Link Path in a Polygon
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
An Efficiently Computable Metric for Comparing Polygonal Shapes.
IEEE Trans. Pattern Anal. Mach. Intell., 1991

The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision.
J. ACM, 1991

A New Algorithm for Shortest Paths Among Obstacles in the Plane.
Ann. Math. Artif. Intell., 1991

Voronoi Diagrams of Moving Points in the Plane.
Proceedings of the 17th International Workshop, 1991

Finding Optimal Bipartitions of Points and Polygons.
Proceedings of the Algorithms and Data Structures, 1991

Matching Points into Noise Regions: Combinatorial Bounds and Algorithms.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
On Maximum Flows in Polyhedral Domains.
J. Comput. Syst. Sci., 1990

On a Triangle Counting Problem.
Inf. Process. Lett., 1990

Path Planning in 0/1/ Weighted Regions with Applications.
INFORMS J. Comput., 1990

Minimum-Link Paths Among Obstacles in the Plane.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
On Monotone Paths Among Obstacles with Applications to Planning Assemblies.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
An Algorithmic Approach to Some Problems in Terrain Navigation.
Artif. Intell., 1988

Path Planning in 0/1/infinity Weighted Regions with Applications.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
The Discrete Geodesic Problem.
SIAM J. Comput., 1987

98%-Effective Lot-Sizing for One-Warehouse, Multi-Retailer Inventory Systems with Backlogging.
Oper. Res., 1987

The Weighted Region Problem.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987


  Loading...