R. L. Drysdale

From MaRDI portal
(Redirected from R. L. Drysdale)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
Information Processing Letters
2010-03-24Paper
Farthest line segment Voronoi diagrams
Information Processing Letters
2010-01-29Paper
An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
Computational Geometry
2009-06-18Paper
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
Computational Geometry
2008-07-29Paper
A comparison of sequential Delaunay triangulation algorithms.
Computational Geometry
2008-04-25Paper
Fast greedy triangulation algorithms.
Computational Geometry
2008-04-25Paper
scientific article; zbMATH DE number 2185616 (Why is no real title available?)2005-07-04Paper
2-point site Voronoi diagrams
Discrete Applied Mathematics
2002-08-29Paper
On exclusion regions for optimal triangulations
Discrete Applied Mathematics
2001-04-04Paper
SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
International Journal of Computational Geometry & Applications
1993-04-01Paper
Fixed-radius near neighbors search algorithms for points and segments
Information Processing Letters
1990-01-01Paper
Discrete simulation of NC machining
Algorithmica
1989-01-01Paper


Research outcomes over time


This page was built for person: R. L. Drysdale