Joseph S. B. Mitchell | Academic Influence

Joseph S. B. Mitchell's AcademicInfluence.com Rankings

Joseph S. B. Mitchell

Computer Science

#918

World Rank

#951

Historical Rank

#498

USA Rank

Database

#2559

World Rank

#2681

Historical Rank

#545

USA Rank

computer-science Degrees

Download Badge

Computer Science

Joseph S. B. Mitchell's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Joseph S. B. Mitchell Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.

(See a Problem?)

Joseph S. B. Mitchell's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs (1998) (971)
An efficiently computable metric for comparing polygonal shapes (1991) (794)
The Discrete Geodesic Problem (1987) (706)
Geometric Shortest Paths and Network Optimization (2000) (482)
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems (1999) (425)
Boundary recognition in sensor networks by topological methods (2006) (418)
The weighted region problem: finding shortest paths through a weighted planar subdivision (1991) (340)
Approximation algorithms for TSP with neighborhoods in the plane (2001) (261)
Approximation algorithms for lawn mowing and milling (2000) (250)
BOXTREE: A Hierarchical Representation for Surfaces in 3D (1996) (196)
Shortest paths among obstacles in the plane (1993) (192)
Approximate minimum enclosing balls in high dimensions using core-sets (2003) (178)
Approximating Polygons and Subdivisions with Minimum Link Paths (1991) (176)
Approximation algorithms for two optimal location problems in sensor networks (2005) (168)
An Algorithmic Approach to Some Problems in Terrain Navigation (1988) (163)
Touring a sequence of polygons (2003) (151)
Shortest Paths and Networks (2004) (145)
On Simultaneous Planar Graph Embeddings (2003) (130)
Approximation algorithms for geometric tour and network design problems (extended abstract) (1995) (125)
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments (2002) (123)
SYSTEM PERFORMANCE CHARACTERISTICS OF CENTRALIZED AND DECENTRALIZED AIR TRAFFIC SEPARATION STRATEGIES (2001) (121)
Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami (1999) (120)
Optimal covering tours with turn costs (2001) (119)
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane (1997) (117)
Voronoi Diagrams of Moving Points (1998) (113)
L1 shortest paths among polygonal obstacles in the plane (1992) (107)
Sweeping simple polygons with a chain of guards (2000) (99)
Minimum-link paths among obstacles in the plane (1990) (99)
Minimum-cost coverage of point sets by disks (2006) (98)
Resource-constrained geometric network optimization (1998) (95)
A PTAS for TSP with neighborhoods among fat regions in the plane (2007) (89)
Approximate Geometric Pattern Matching Under Rigid Motions (1999) (87)
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract) (1997) (86)
Hamiltonian triangulations for fast rendering (1996) (85)
Geometric algorithms for optimal airspace design and air traffic controller workload balancing (2008) (85)
Separation and approximation of polyhedral objects (1992) (84)
ZSWEEP: An Efficient and Exact Projection Algorithm for Unstructured Volume Rendering (2000) (83)
Capacity Estimation for Airspaces with Convective Weather Constraints (2007) (83)
New results on shortest paths in three dimensions (2004) (82)
On the Continuous Fermat-Weber Problem (2003) (81)
Airspace Throughput Analysis Considering Stochastic Weather (2006) (81)
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping (2002) (80)
Generating Random Polygons with Given Vertices (1996) (80)
Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem (1996) (80)
When can you fold a map? (2000) (79)
Path planning in 0/1/ weighted regions with applications (1988) (78)
Distributed localization using noisy distance and angle information (2006) (77)
Locating Guards for Visibility Coverage of Polygons (2007) (76)
Fast and effective stripification of polygonal surface models (1999) (76)
Decision trees for geometric models (1993) (74)
On monotone paths among obstacles with applications to planning assemblies (1989) (70)
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids (1998) (69)
Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies (2002) (68)
Improved Approximation Algorithms for Relay Placement (2008) (67)
On maximum flows in polyhedral domains (1988) (66)
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids (1997) (65)
Query-sensitive ray shooting (1994) (65)
An exact interactive time visibility ordering algorithm for polyhedral cell complexes (1998) (63)
Automated Route Generation for Avoiding Deterministic Weather in Transition Airspace (2007) (63)
Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version) (1994) (63)
Maximum Flow Rates for Capacity Estimation in Level Flight with Convective Weather Constraints (2007) (62)
Safe Routing of Multiple Aircraft Flows in the Presence of Time-Varying Weather Data (2004) (62)
Light-Weight Contour Tracking in Wireless Sensor Networks (2008) (61)
Comparison of Algorithms for Synthesizing Weather Avoidance Routes in Transition Airspace (2004) (61)
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots (2002) (60)
Simplifying a polygonal subdivision while keeping it simple (2001) (60)
An Optimal Algorithm for Computing Visibility in the Plane (1991) (59)
The Open Problems Project (2007) (59)
The weighted region problem (1987) (58)
Two-point Euclidean shortest path queries in the plane (1999) (57)
Geometric stable roommates (2009) (56)
A constant-factor approximation algorithm for optimal terrain guarding (2005) (55)
Turn-Constrained Route Planning for Avoiding Hazardous Weather (2006) (55)
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions (2003) (54)
A new algorithm for shortest paths among obstacles in the plane (1991) (52)
Planning Strategic Paths Through Variable Terrain Data (1984) (51)
Automatic generation of triangular irregular networks using greedy cuts (1995) (50)
Not being (super)thin or solid is hard: A study of grid Hamiltonicity (2009) (50)
Fast rendering of irregular grids (1996) (49)
Computing a shortest k-link path in a polygon (1992) (49)
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane (2010) (48)
Minimum-link watchman tours (2003) (47)
Computing the visibility graph of points within a polygon (2004) (46)
Real-time collision detection for motion simulation within complex environments (1996) (46)
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding (2007) (45)
On Minimum-Area Hulls (1998) (43)
Thick non-crossing paths and minimum-cost flows in polygonal domains (2007) (43)
Separation and approximation of polyhedral surfaces (1991) (42)
Approximating Watchman Routes (2013) (42)
Edit distance of run-length encoded strings (2002) (40)
Voronoi Diagrams of Moving Points in the Plane (1991) (39)
Preprocessing Imprecise Points and Splitting Triangulations (2008) (39)
Hamilton Triangulations for Fast Rendering (1994) (38)
Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks (2008) (38)
Triangulating input-constrained planar point sets (2008) (38)
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd (1999) (37)
Visibility preserving terrain simplification: an experimental study (2002) (37)
Flexible, Performance-based Route Planning for Super-Dense Operations (2008) (37)
Shortest Rectilinear Paths Among Obstacles (1987) (36)
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles (2004) (35)
On a Triangle Counting Problem (1990) (35)
The Lawnmower Problem (1993) (35)
Orthogonal segment stabbing (2005) (35)
Optimal decomposition of polygonal models into triangle strips (2002) (34)
On the Reflexivity of Point Sets (2001) (34)
Dynamic Airspace Configuration Management based on Computational Geometry Techniques (2008) (33)
Optimal link path queries in a simple polygon (1992) (33)
Continuous Weber and k-Median Problems (2000) (33)
Efficient Algorithms for Maximum Regression Depth (1999) (33)
Estimating time of arrival in heavy weather conditions (1999) (32)
Continuous foldability of polygonal paper (2004) (31)
The Lazy Bureaucrat scheduling problem (1999) (31)
Flow Conforming Operational Airspace Sector Design (2010) (31)
Finding large sticks and potatoes in polygons (2006) (31)
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs (2015) (30)
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms (1992) (30)
On the Maximum Scatter Traveling Salesperson Problem (1999) (29)
Maximum thick paths in static and dynamic environments (2008) (29)
Counting Convex Polygons in Planar Point Sets (1995) (28)
Delineating Boundaries for Imprecise Regions (2005) (28)
Bicriteria Shortest Path Problems in the Plane ( extended abstract ) (28)
Geometric knapsack problems (1991) (28)
A maximumb-matching problem arising from median location models with applications to the roommates problem (1998) (27)
Minimum-link paths revisited (2013) (27)
Beacon-Based Algorithms for Geometric Routing (2013) (26)
Matching points into noise regions: combinatorial bounds and algorithms (1991) (25)
On the Complexity of Shattering Using Arrangements (1991) (25)
Multilevel Path Planning For Autonomous Vehicles (1984) (25)
Bichromatic 2-center of pairs of points (2012) (25)
On the maximum scatter TSP (1997) (24)
Some Lower Bounds on Geometric Separability Problems (2006) (24)
Matching Points with Squares (2009) (24)
Locked and Unlocked Chains of Planar Shapes (2006) (24)
On Simultaneous Graph Embedding (2002) (22)
Minimum-perimeter enclosures (2008) (22)
Time-critical rendering of irregular grids (2000) (21)
Approximation Algorithms for Geometric Separation Problems (2009) (21)
Touring Convex Bodies - A Conic Programming Solution (2005) (21)
The snowblower problem (2006) (21)
Capacity Estimation for Super-Dense Operations (2008) (20)
Online dispersion algorithms for swarms of robots (2003) (20)
Terrain Decomposition and Layered Manufacturing (2001) (20)
Scheduling Aircraft to Reduce Controller Workload (2009) (20)
Algorithmic Traffic Abstraction and its Application to NextGen Generic Airspace (2010) (20)
Logarithmic-time link path queries in a simple polygon (1995) (20)
Minimum covering with travel cost (2009) (19)
Greedy cuts: an advancing front terrain triangulation algorithm (1998) (19)
Convex transversals (2011) (18)
k-Link Shortest Paths in Weighted Subdivisions (2005) (18)
Choice is hard (2001) (18)
Analysis of Heuristics for the Freeze-Tag Problem (2002) (18)
Conflict-free Covering (2015) (17)
Approximation algorithms for location problems in sensor networks. (2005) (17)
Designing On-Demand Coded Departure Routes (2006) (17)
Collision detection for fly-throughs in virtual environments (1996) (16)
The Art Gallery Theorem for Polyominoes (2012) (16)
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks (2014) (16)
On the continuous Weber and k-median problems (extended abstract) (2000) (16)
A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane (1999) (15)
Exploring and Triangulating a Region by a Swarm of Robots (2011) (15)
Matching Points with Circles and Squares (2004) (15)
Shortest path to a segment and quickest visibility queries (2015) (15)
Secure Communication through Jammers Jointly Optimized in Geography and Time (2015) (15)
Approximating Maximum Independent Set for Rectangles in the Plane (2021) (14)
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles (2001) (14)
An algorithmic study of manufacturing paperclips and other folded structures (2002) (14)
Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity (2017) (13)
Point Probe Decision Trees for Geometric Concept Classes (1993) (13)
Arrangements of segments that share endpoints: Single face results (1991) (13)
The minimum backlog problem (2015) (13)
Combinatorics of Beacon Routing and Coverage (2013) (13)
A Geometric Shortest Path Problem, with Application to Computing a Longest Common Subsequence in Run-length Encoded Strings (2008) (13)
Connecting a set of circles with minimum sum of radii (2011) (13)
On the Chromatic Art Gallery Problem (2014) (12)
Farthest neighbors and center points in the presence of rectngular obstacles (2001) (12)
Structured visibility profiles with applications to problems in simple polygons (extended abstract) (1989) (12)
Geometric Hitting Set for Segments of Few Orientations (2015) (12)
Shortest Paths Among Obstacles, Zero-Cost Regions, and Roads (1987) (11)
An Autonomous Vehicle Navigation Algorithm (1984) (11)
Reaching folded states of a rectangular piece of paper (2001) (11)
Finding Optimal Bipartitions of Points and Polygons (1991) (11)
Path Planning in O/1/infinity Weighted Regions with Applications (1988) (11)
Guarding polyominoes (2011) (11)
Optimal placement of protective jammers for securing wireless transmissions in a geographic domain (2015) (10)
Algorithmic approaches to optimal route planning (1991) (10)
Optimizing restriction site placement for synthetic genomes (2010) (10)
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions (2011) (10)
Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network (2015) (10)
Geometric algorithms for dynamic airspace sectorization (2009) (10)
Testing Simple Polygons (1997) (10)
Two Methods for Computing Directional Capacity given Convective Weather Constraints (2009) (10)
Hamiltonian Cycles in Triangular Grids (2006) (10)
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains (2002) (9)
Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem (2004) (9)
Routing multi-class traffic flows in the plane (2012) (9)
Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 (2021) (9)
Bounded stretch geographic homotopic routing in sensor networks (2014) (9)
The minimum area spanning tree problem (2006) (8)
Iso-Contour Queries and Gradient Routing with Guaranteed Delivery in Sensor Networks (2007) (8)
Some Separability Problems in the Plane (2000) (8)
Data transmission and base-station placement for optimizing network lifetime (2010) (8)
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint (2019) (8)
M3: Microscope-based maskless micropatterning with dry film photoresist (2011) (8)
Algorithms for two-box covering (2006) (8)
Geometric decision trees for optical character recognition (extended abstract) (1997) (8)
Clustering and reconstructing large data sets (2004) (8)
Picture-Hanging Puzzles (2012) (7)
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (2015) (7)
Selecting and covering colored points (2018) (7)
Throughput / Complexity Tradeoffs for Routing Traffic in the Presence of Dynamic Weather (2010) (7)
Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (2021) (7)
Flexible Airlane Generation to Maximize Flow Under Hard and Soft Constraints (2011) (7)
Computing Nonsimple Polygons of Minimum Perimeter (2016) (7)
Some path planning algorithms in computational geometry and air traffic management (2012) (7)
Distributed localization and clustering using data correlation and the Occam's razor principle (2011) (6)
Locating Battery Charging Stations to Facilitate Almost Shortest Paths (2019) (6)
A Near-Tight Approximation Algorithm for the Robot Localization Problem (2009) (6)
A Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs ∗ (2013) (6)
Efficient algorithms for pursuing moving evaders in terrains (2012) (6)
Watchman routes for lines and line segments (2014) (6)
The Balanced Connected Subgraph Problem (2018) (6)
Computing the $$L_1$$L1 Geodesic Diameter and Center of a Polygonal Domain (2015) (5)
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World (2018) (5)
Planning Routes with Wiggle Room in En Route Weather- Impacted Airspaces (2009) (5)
On the Manufacturability of Paperclips and Sheet Metal Structures (1999) (5)
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices (2012) (5)
Efficient collision detection for interactive three-dimensional graphics and virtual environments (1998) (5)
On the convexification of unstructured grids from a scientific visualization perspective (2006) (5)
Recognizing polygonal parts from width measurements (1998) (5)
Flexible Tube-Based Network Control (2009) (5)
Two New Classes of Hamiltonian Graphs: (Extended Abstract) (2007) (5)
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths (2019) (5)
Watchman Routes for Lines and Segments (2012) (5)
Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020 (2020) (5)
The Minimum Guarding Tree Problem (2014) (5)
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets (2001) (5)
Shortest Paths for a Two-robot Rendez-vous (1993) (5)
Spiral Serpentine Polygonization of a Planar Point Set (2011) (5)
Approximating Maximum Flow in Polygonal Domains using Spanners (2009) (4)
On the Maximum Scatter TSP (Extended Abstract) (1997) (4)
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (2015) (4)
Matching regions in the plane using non-crossing segments (2015) (4)
Generating Random x-Monotone Polygons with Given Vertices (1994) (4)
Sensitivity of Capacity Estimation Results subject to Convective Weather Forecast Errors (2009) (4)
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions (2006) (4)
An Experimental Study of Weighted k-Link Shortest Path Algorithms (2008) (4)
The Shortest Separating Cycle Problem (2016) (4)
TSP With Locational Uncertainty: The Adversarial Model (2017) (4)
Visibility preserving terrain simplification-- an experimental study (2004) (4)
Localizing an object with finger probes (1995) (4)
Chapter 7 A survey of computational geometry (1995) (3)
Data inference from encrypted databases: a multi-dimensional order-preserving matching approach (2020) (3)
Local Redesigning of Airspace Sectors (2013) (3)
Optimizing Read Reversals for Sequence Compression - (Extended Abstract) (2015) (3)
Routing a maximum number of disks through a scene of moving obstacles (2008) (3)
Geometric methods for optical character recognition (1997) (3)
Approximation Algorithms for Time-Window TSP and Prize Collecting TSP Problems (2016) (3)
Matching points with geometric objects : Combinatorial results (2004) (3)
Combinatorics and complexity in geometric visibility problems (2012) (3)
Two New Classes of Hamiltonian Graphs (2007) (2)
Airspace design with explicit utilization of convective weather forecast data for reduced traffic flow management actions (2013) (2)
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading (2017) (2)
Computing Geometric Structures of Low Stabbing Number in the Plane ∗ (2007) (2)
On Finding Large Empty Convex Bodies in 3D Scenes of Polygonal Models (2008) (2)
Optimal enclosure problems (1990) (2)
Approximation Schemes for Geometric Network Optimization Problems (2016) (2)
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box (2012) (2)
k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane (2005) (2)
Conflict Resolution Algorithms for Super Density Operations Impacted by Off-Nominal Events (2013) (2)
Network Optimization on Partitioned Pairs of Points (2017) (2)
Algorithms for swarm robotics (2003) (2)
Bounded Stretch Homotopic Routing Using Hyperbolic Embedding of Sensor Networks (2012) (2)
Algorithms for optimizing multiple routes through constrained geometric domains (2010) (2)
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization (2020) (2)
Algorithms and complexity results for three problems in applied computational geometry: subdivision simplification, stripification of triangulations, and unions of jordan regions (2000) (2)
How to Water Carrots : Geometric Coverage Problems for Point Sets (2005) (1)
Algorithmic Problems in Air Traffic Management (2009) (1)
Geometric Hitting Set for Segments of Few Orientations (2017) (1)
Robust airspace design methods for uncertain traffic and weather (2013) (1)
Hybrid Algorithms for Scheduling Sensors for Guarding Polygonal Domains (2014) (1)
Geometric Tours to Visit and View Polygons Subject to Time Lower Bounds (2019) (1)
Minimum-Perimeter Enclosing k-gon (2006) (1)
Minimum Membership Covering and Hitting (2018) (1)
On Matching Robustness (2007) (1)
Coupling techniques for dense surface registration: a continuous-discrete approach (2012) (1)
Probing a Set of Trajectories to Maximize Captured Information (2020) (1)
On Guarding and Partitioning Polygons (2005) (1)
The Length of the Longest Edge in Multi-dimensional Delaunay Graphs (2010) (1)
Shape registration and analysis framework for computer vision and graphics (2008) (1)
Existence and hardness of conveyor belts (2019) (1)
32 : 2 TSP With Locational Uncertainty : The Adversarial Model (2017) (1)
Metrics for Evaluating the Impact of Weather on Jet Routes (2011) (1)
A Survey of Computational Geometry (2014) (1)
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (2018) (1)
Concept of Operations for Addressing Types of En Route Hazardous Weather Constraints in NextGen (2009) (1)
Recognizing Simply Foldable Origami (2007) (1)
The Minimum-Area Spanning Tree Problem (2005) (1)
On Some Applications of Computational Geometry in Manufacturing and Virtual Environments (1996) (1)
Computing β-Stretch Paths in Drawings of Graphs (2020) (1)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2014) (1)
On Geometric Stable Roommates and MinimumWeight Matching Robustness ( Extended Abstract ) ∗ (2007) (0)
Algorithms for k-Dispersion for Points in Convex Position in the Plane (2023) (0)
Approximation algorithms for geometric routing problems (1998) (0)
Link distance query problems in polygons (1991) (0)
A Constant-Factor Approximation Algorithm for TSP with Neighborhoods in the Plane ∗ (1996) (0)
Online Dispersion Algorithms of Robot Swarms (2003) (0)
Proceedings of the Annual Symposium on Computational Geometry (10th) Held at Stony Brook, New York on 6-8 June, 1994. (1995) (0)
C G ] 2 O ct 2 00 2 On the Reflexivity of Point Sets (2008) (0)
Balanced Dynamic Loading and Unloading (2020) (0)
Editor's foreword (2004) (0)
Flexible Tubebasedetwork Control (2009) (0)
Guest Editor’s Foreword (2007) (0)
Open Problems from CCCG 2012 (2013) (0)
Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane (2023) (0)
Geometric Flows in Grids : Static , Dynamic , and In-Between (2009) (0)
New Results on a Family of Geometric Hitting Set Problems in the Plane (2019) (0)
Packing and Covering with Segments (2020) (0)
NONSIMPLE POLYGONS OF MINIMUM PERIMETER ∗ (2017) (0)
14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, September 11, 2014, Wroclaw, Poland (2014) (0)
Figure 1. Grid Representation (2017) (0)
Lazy Sweep Ray Casting A Fast Scanline Algorithm for Rendering Irregular Grids (2007) (0)
31 SHORTEST PATHS AND NETWORKS (2017) (0)
Combinatorics, algorithms and systems for sensor deployment with line-of-sight constraints: poster (2016) (0)
The $r$-Gather Problem in Euclidean Space (2015) (0)
THICK NON-CROSSING PATHS (2005) (0)
The Embroidery Problem (2008) (0)
Balanced Dynamic Loading and Unloading ∗ Sándor (2018) (0)
A ug 2 00 1 Computational Geometry Column 42 (2008) (0)
Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons (2021) (0)
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing (2013) (0)
Geometric algorithms for analyzing and controlling swarms of robots and groups of aircraft (2003) (0)
Planar Bichromatic Bottleneck Spanning Trees (2020) (0)
On Flipping the Fr\'{e}chet distance (2022) (0)
Separability of Point Sets by k-Level Linear Classification Trees (2012) (0)
On Counting Lines rather than Pages The CG Steering Committee and the SoCG 2019 PC Chairs (2018) (0)
Exploring advanced communication primitives using greedy routing in sensor networks and other complex networks (2012) (0)
An Optimal Algorithm for L 1 Shortest Paths Among Obstacles in the Plane ( Draft ) (2010) (0)
Universal Guard Problems (2016) (0)
Capturing Crossings: Convex Hulls of Segment and Plane Intersections (2007) (0)
Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010 (2010) (0)
The Pencil Packing Problem ∗ (2019) (0)
Guillotine Subdivisions Approximate Polygonal Subdivisions : A Simple Approximation Method for Geometric Network Optimization (0)
Localizing an object with nger probes (2006) (0)
On Non-crossing ( Projected ) Spanning Trees of 3 D point sets (2009) (0)
Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005 (2005) (0)
On robots swarm dispersion, task scheduling in distributed systems, and web-based short period style analysis (2002) (0)
An Optimal Algorithm for Minimum-Link 1 Rectilinear Paths in Rectilinear Domains (2015) (0)
On Minimum-Area Hulls (Extended Abstract) (1996) (0)
Efficient rendering of volumetric irregular grids data (2001) (0)
Algorithmic geometry for manufacturing process planning (2001) (0)
Optimizing Sensor Deployment With Line-Of-Sight Constraints: Theory and Practice (2019) (0)
Open Problem Session (2009) (0)
Foreword (2001) (0)
Guest Editors' Foreword (1997) (0)
Geometric Spanning Trees Minimizing the Wiener Index (2023) (0)
32 PROXIMITY ALGORITHMS (2016) (0)
Reconstructing sharp features of triangular meshes (2009) (0)
ALGORITHMS FOR MANUFACTURING PAPERCLIPS AND SHEET METAL STRUCTURES (2021) (0)
Algorithmic problems in air traffic management: invited presentation (2009) (0)
Succinct strip encoding of triangle meshes (2001) (0)
Computational geometry (2001) (0)
roceedings of The 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc 2017) (2017) (0)
A note from the editors-in-chief (2004) (0)
Optimal Cutting of a Polygon by Lasers (2016) (0)
Invited talk: Computational Geometry in Air Traffic Management (2012) (0)
Guest Editors' Introduction (1992) (0)
Probing a Set of Trajectories to Maximize Captured Movement (2020) (0)
Manufacturing: An Application Domain for Computational Geometry (1995) (0)

This paper list is powered by the following services:

Other Resources About Joseph S. B. Mitchell

en.wikipedia.org

What Schools Are Affiliated With Joseph S. B. Mitchell?

Joseph S. B. Mitchell is affiliated with the following schools:

Image Attributions

Image Source for Joseph S. B. Mitchell