Aurélien Ooms

activity

20152021

k

-SUM using few linear queries

2 citations · 3 across the 5 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.CG2018

Improved Bounds for Guarding Plane Graphs with Edges

Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms +1

An "edge guard set" of a plane graph $G$ is a subset $Γ$ of edges of $G$ such that each face of $G$ is incident to an endpoint of an edge in $Γ$ . Such a set is said to guard $G$ . W…

cs.CG2018

Subquadratic Encodings for Point Configurations

Jean Cardinal, Timothy M. Chan, John Iacono +2

For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation o…