13 citations · 19 across the 4 of their papers we have counts for
5 papers
Computing skeletons for rectilinearly-convex obstacles in the rectilinear plane
Marcus Volz, Marcus Brazil, Charl Ras +1
We introduce the concept of an obstacle skeleton which is a set of line segments inside a polygonal obstacle that can be used in place of when performing intersection tests…
The -connected bottleneck Steiner network problem is NP-hard in any plane
M Brazil, C Ras, D Thomas +1
Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most Steiner points s…
The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks
Yahui Sun, Marcus Brazil, Doreen Thomas +1
It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objectiv…
Minimal curvature-constrained networks
David Kirszenblat, Kashyapa Sirinanda, Marcus Brazil +3
This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterati…
Minimum Opaque Covers for Polygonal Regions
J. Scott Provan, Marcus Brazil, Doreen Thomas +1
The Opaque Cover Problem (OCP), also known as the Beam Detector Problem, is the problem of finding, for a set S in Euclidean space, the minimum-length set F which intersects every…