The following pages link to Matthew T. Dickerson (Q916421):
Displayed 28 items.
- Fixed-radius near neighbors search algorithms for points and segments (Q916423) (← links)
- Item:Q916421 (redirect page) (← links)
- Item:Q1190749 (redirect page) (← links)
- The inverse of an automorphism in polynomial time (Q1190750) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- A large subgraph of the minimum weight triangulation (Q1380821) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- 2-point site Voronoi diagrams (Q1613413) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- A simple algorithm for enumerating longest distances in the plane (Q2366076) (← links)
- On 2-site Voronoi diagrams under geometric distance functions (Q2434572) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- (Q2753934) (← links)
- (Q3024763) (← links)
- (Q3024781) (← links)
- Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks (Q3223935) (← links)
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way (Q3378507) (← links)
- Cloning Voronoi Diagrams via Retroactive Data Structures (Q3586477) (← links)
- SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS (Q4030349) (← links)
- General polynomial decomposition and the s-1-decomposition are NP-Hard (Q4286117) (← links)
- (Q4875175) (← links)
- Voronoi diagrams for polygon-offset distance functions (Q5096938) (← links)
- Offset-polygon annulus placement problems (Q5096954) (← links)
- Graph Drawing (Q5193162) (← links)
- Voronoi diagrams for convex polygon-offset distance functions (Q5932811) (← links)