#### Filter Results:

#### Publication Year

1995

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn 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)

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

We show that finding the optimistic shortest path on an uncertain terrain is NP-hard using a reduction similar to Canny and Reif's reduction of 3SAT to 3D Euclidean shortest path. 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… (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)

- Boris Aronov, Mark de Berg, Chris Gray
- Symposium on Computational Geometry
- 2006

We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity <i>n</i> in <i>R</i><sup>3</sup>. The data structure uses <i>O(n</i><sup>2+ε</sup>) storage and preprocessing time, and queries can be answered in <i>O</i>(log<sup>2</sup> <i>n</i>) time. A trade-off between storage and query time is also possible:… (More)

- Chris Gray, Maarten Löffler, Rodrigo I. Silveira
- WAOA
- 2008

We study optimization problems for polyhedral terrains in the presence of data imprecision. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to terrains with a one-dimensional projection, usually referred to as 1.5-dimensional terrains,… (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… (More)

- Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford
- SODA
- 2008

We study the problem of cutting a set of rods (line segments in ℝ<sup>3</sup>) into fragments, using a minimum number of cuts, so that the resulting set of fragments admits a depth order. We prove that this problem is NP-complete, even when the rods have only three distinct orientations. We also give a polynomial-time approximation algorithm with no… (More)

- Chris Gray
- Scholarpedia
- 2009

- 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)