Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Efficient Expected-Case Algorithms for Planar Point Location
 

Summary: Efficient Expected-Case Algorithms for Planar
Point Location
Sunil Arya1
, Siu-Wing Cheng1
, David M. Mount2
, and H. Ramesh3
1
Department of Computer Science, The Hong Kong University of Science and
Technology,
Clear Water Bay, Kowloon, Hong Kong
{arya, scheng}@cs.ust.hk
2
Department of Computer Science and Institute for Advanced Computer Studies,
University of Maryland, College Park, Maryland
mount@cs.umd.edu
3
Department of Computer Science and Automation, Indian Institute of Science,
Bangalore, India
ramesh@csa.iisc.ernet.in
Abstract. Planar point location is among the most fundamental search

  

Source: Arya, Sunil - Department of Computer Science, Hong Kong University of Science and Technology

 

Collections: Computer Technologies and Information Sciences