output
19922026
most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

Showing 2013 · cs.CGShow all

11 papers · 2 filters

cs.CG2013★ 1 cited

Linear transformation distance for bichromatic matchings

Oswin Aichholzer, Luis Barba, Thomas Hackl +2

Let be a set of points in general position, where is a set of blue points and a set of red points. A \emph{-matching} is a plane geometric perf…

cs.CG2013★ 1 cited

Computing the Coverage of an Opaque Forest

Alexis Beingessner, Michiel Smid

We consider the problem of taking an opaque forest and determining the regions that are covered by it. We provide a tight upper bound on the complexity of this problem, and an algo…

cs.CG2013★ 1 cited

Computing Covers of Plane Forests

Luis Barba, Alexis Beingessner, Prosenjit Bose +1

Let be a function that maps any non-empty subset of to a non-empty subset of . A -cover of a set of pair…

cs.CG2013★ 40 cited

Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph

Pegah Kamousi, Sylvain Lazard, Anil Maheshwari +1

A standard way to approximate the distance between any two vertices and on a mesh is to compute, in the associated graph, a shortest path from to that goes through…

cs.CG2013

Approximating the Bottleneck Plane Perfect Matching of a Point Set

A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi +2

A bottleneck plane perfect matching of a set of points in is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the len…

cs.CG2013★ 1 cited

New and Improved Spanning Ratios for Yao Graphs

Luis Barba, Prosenjit Bose, Mirela Damian +7

For a set of points in the plane and a fixed integer , the Yao graph partitions the space around each point into equiangular cones of angle , and connects…