Sciweavers

100 search results - page 4 / 20
» A simple entropy-based algorithm for planar point location
Sort
View
COMPGEOM
2001
ACM
14 years 2 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
ICCV
2003
IEEE
14 years 4 months ago
Plane-based Calibration Algorithm for Multi-camera Systems via Factorization of Homography Matrices
A new calibration algorithm for multi-camera systems using a planar reference pattern is proposed. The algorithm is an extension of Sturm-Maybank-Zhang style plane-based calibrati...
Toshio Ueshiba, Fumiaki Tomita
INFOCOM
2008
IEEE
14 years 5 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 10 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
13 years 10 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis