#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2001

2017

- This year (2)
- Last 5 years (12)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, we describe a simple algorithm for triangulating k-guardable polygons. Our algorithm, which is easily implementable, takes linear time assuming that k is constant.

- Chris Gray, William S. Evans
- CCCG
- 2004

Shortest path problems are a well-studied class of problems in theoretical computer science. One particularly applicable type of shortest path problem is to find the geodesic shortest path on a terrain. This type of algorithm finds the shortest path between two points that stays on the surface of a terrain. The most popular methods for finding such a… (More)

- Chris Gray, Hitoshi Nukada, David M Jackson, P Denise McMorran, A Wu, F Ma
- Brain research
- 2003

The nitrone-based free radical scavengers have potent neuroprotective activities in models of stroke in which oxidative stress plays a key role in its development. We examined the effects of S-PBN (sodium 4-[(tert-butylimino) methyl]benzene-3-sulfonate N-oxide), a spin trap nitrone, on reperfusion injury in rat peripheral nerves. Immediately after the onset… (More)

- Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira
- Comput. Geom.
- 2012

In this paper we consider imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. In particular, we study the problem of removing as many local extrema (minima and maxima) as possible from the terrain. We show that removing only minima or only maxima can be done optimally in O(n log n) time, for a terrain with n… (More)

- Chris Gray
- Scholarpedia
- 2009

- Mark de Berg, Chris Gray
- WADS
- 2007

We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm runs in O((n + k) polylog n) time, where k is the combinatorial complexity of the visibility map. This is the first algorithm for computing the visibility map of fat objects that does not… (More)

- Patrick Mitchell, Barbara A Gregson, +22 authors A David Mendelow
- The Lancet. Neurology
- 2009

- Mark de Berg, Chris Gray
- SIAM J. Comput.
- 2006

We present new results for three problems dealing with a set <i>P</i> of <i>n</i> convex constant-complexity fat polyhedra in 3-space. (i) We describe a data structure for vertical ray shooting in <i>P</i> that has <i>O</i>(log<sup>2</sup> <i>n</i>) query time and uses <i>O</i>(<i>n</i> log<sup>2</sup> <i>n</i>) storage. (ii) We give an algorithm to compute… (More)

- Ratika Parkash, John L Sapp, +7 authors Jafna Cox
- Circulation. Arrhythmia and electrophysiology
- 2012

BACKGROUND
Underuse of implantable defibrillators has been previously noted in patients at risk for sudden cardiac death, as well as for survivors of sudden cardiac death. We sought to determine the utilization rates in a primary prevention implantable cardioverter-defibrillator (ICD)-eligible population and mortality in this group compared with a group… (More)

- Sándor P. Fekete, Chris Gray, Alexander Kröller
- COCOA
- 2010

We investigate the problem of creating fast evacuation plans for buildings that are modeled as grid polygons, possibly containing exponentially many cells. We study this problem in two contexts: the “confluent” context in which the routes to exits remain fixed over time, and the “non-confluent” context in which routes may change. Confluent evacuation plans… (More)