4 citations · 4 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…
Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem
Michael S. Payne, Charl Ras, Marcus Volz
Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful data for the construction of optimal Euclidean -Steiner trees. The theoretical time complexity of construc…
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…
Degree Bounded Bottleneck Spanning Trees in Three Dimensions
Patrick J. Andersen, Charl J. Ras
The geometric -minimum spanning tree problem (-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the…
Unsupervised Basis Function Adaptation for Reinforcement Learning
Edward W. Barker, Charl J. Ras
When using reinforcement learning (RL) algorithms to evaluate a policy it is common, given a large state space, to introduce some form of approximation architecture for the value f…