The following pages link to J. E. Hershberger (Q1384195):
Displaying 50 items.
- (Q194161) (redirect page) (← links)
- (Q476454) (redirect page) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- Kinetic collision detection with fast flight plan changes (Q834964) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- A new data structure for shortest path queries in a simple polygon (Q1178232) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- Upper envelope onion peeling (Q1199830) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
- On arrangements of Jordan arcs with three intersections per pair (Q1262864) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- Kinetic collision detection between two simple polygons. (Q1428461) (← links)
- Morphing simple polygons (Q1577545) (← links)
- Lower bounds for kinetic planar subdivisions (Q1591059) (← links)
- Smooth kinetic maintenance of clusters (Q1775777) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- Stable snap rounding (Q1940702) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Adaptive sampling for geometric problems over data streams (Q2477195) (← links)
- Improved output-sensitive snap rounding (Q2482192) (← links)
- Adaptive spatial partitioning for multidimensional data streams (Q2509025) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- (Q2749774) (← links)
- (Q2768286) (← links)
- (Q2768318) (← links)
- Bundled Crossings in Embedded Graphs (Q2802960) (← links)
- Computing Shortest Paths amid Convex Pseudodisks (Q2848214) (← links)
- On the difficulty of some shortest path problems (Q2944541) (← links)
- Hyperplane separability and convexity of probabilistic point sets (Q2970475) (← links)
- The Union of Probabilistic Boxes: Maintaining the Volume (Q3092263) (← links)
- (Q3132872) (← links)
- (Q3138890) (← links)
- (Q3138936) (← links)
- (Q3140401) (← links)
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS (Q3212329) (← links)