Ralph P. Boland

According to our database, Ralph P. Boland authored at least 7 papers between 1995 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

Partitioning Polygons into Tree Monotone and -monotone Subpolygons.

Ralph P. Boland, Jorge Urrutia

Proceedings of the Computational Science and Its Applications, 2003

2001

Finding the largest axis aligned rectangle in a polygon in o(n log n) time.

Ralph P. Boland, Jorge Urrutia

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

A simpler circular ray shooting algorithm.

Ralph P. Boland, Jorge Urrutia

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Polygon Area Problems.

Ralph P. Boland, Jorge Urrutia

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

Circular Ray Shooting: Slower but Surer.

Ralph P. Boland, Jorge Urrutia

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1995

Corrigendum: Separating Collections of Points in Euclidean Spaces.

Ralph P. Boland, Jorge Urrutia

Inf. Process. Lett., 1995

Separating Collections of Points in Euclidean Spaces.

Ralph P. Boland, Jorge Urrutia

Inf. Process. Lett., 1995