Back to Results
First PageMeta Content
Computational geometry / Combinatorics / Delaunay triangulation / Convex hull algorithms / Quicksort / Convex hull / Boundary / Euclidean minimum spanning tree / Pitteway triangulation / Triangulation / Geometry / Mathematics


OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES∗ David Bremner† Erik Demaine‡ Pat Morin∗∗
Add to Reading List

Document Date: 2007-12-27 15:24:28

Open Document

File Size: 223,67 KB

Share Result on Facebook

Company

MIT Laboratory / /

Country

Canada / /

/

Facility

Carleton University / University of New Brunswick / University of Illinois / McGill University / Polytechnic University / /

IndustryTerm

output-sensitive algorithms / divide-and-conquer algorithm / linear-time median finding algorithms / output-sensitive convex hull algorithms / above algorithm / time sorting algorithms / point-location algorithm / /

Organization

School of Computer Science / School of Computer / University of Illinois / Polytechnic University / Faculty of Computer Science / MIT / McGill University / The Natural Sciences and Engineering Research Council of Canada / Carleton University / Computer Science Department / University of New Brunswick / /

Person

John Iacono¶ Stefan Langermank / Jeff Erickson§ John Iacono / Pat Morin∗∗ Jeff / Stefan Langermank Godfried Toussaint / Erik Demaine‡ Pat Morin / David Bremner† Erik Demaine / /

Product

Lemma 1 / /

ProvinceOrState

New Brunswick / /

Technology

existing linear-time median finding algorithms / 1-Dimensional Algorithm / above algorithm / time algorithm / point-location algorithm / convex hull algorithms / time algorithms / 2-Dimensional Algorithm / divide-and-conquer algorithm / time sorting algorithms / /

SocialTag