Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

SODA
2001
ACM

favoriteEmaildiscussreport

94views Algorithms» more SODA 2001»

Computing the depth of a flat

13 years 5 months ago

Computing the depth of a flat

Download www.ics.uci.edu

We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or

Marshall W. Bern

Real-time Traffic

Algorithms | Compute | Regression Depth | SODA 2001 |

claim paper

Related Content

» Beyond Flat Panning and Zooming DollyEnhanced SQTVR

» Dynamic adjustment of stereo display parameters

» Flat refractive geometry

» Beyond flat surface computing challenges of depthaware and curved interfaces

» Challenges in Building a FlatBandwidth Memory Hierarchy for a LargeScale Computer with Pro...

» Folding Flat Silhouettes and Wrapping Polyhedral Packages New Results in Computational Ori...

» Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth

» RayShooting Depth Computing Statistical Data Depth of Point Sets in the Plane

» Usage of needle maps and shadows to overcome depth edges in depth map reconstruction

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	SODA
Authors	Marshall W. Bern

Comments (0)