19 citations · 52 across the 15 of their papers we have counts for
16 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 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…
Approximate Euclidean Steiner Trees
Charl Ras, Konrad J. Swanepoel, Doreen Thomas
An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error e from 120 degr…
Demonstrating efficiency gains from installing truck turntables at crushers
Marcus Brazil, Peter A Grossman, J Hyam Rubinstein +1
The installation of truck turntables at above-ground crushers has the potential to yield gains in efficiency and productivity by eliminating the need for the trucks to turn around…
Determining the open pit to underground transition: A new method
D. Whittle, M. Brazil, P. A. Grossman +2
Many Ore Reserves are harvested by a combination of open pit and underground mining methods. In these cases there is often material that could be mined by either method, and a choi…