3 citations · 4 across the 3 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2011★ 1 cited
Random hyperplane search trees in high dimensions
Luc Devroye, James King
Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting…
cs.CG2011
Fast Vertex Guarding for Polygons
James King
For a polygon P with n vertices, the vertex guarding problem asks for the minimum subset G of P's vertices such that every point in P is seen by at least one point in G. This probl…
cs.CG2009★ 3 cited
The Complexity of Guarding Terrains
James King, Erik Krohn
A set of points on a 1.5-dimensional terrain, also known as an -monotone polygonal chain, is said to guard the terrain if any point on the terrain is 'seen' by a point in $G…