Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
9
click to vote
COMPGEOM
2001
ACM
favorite
Email
discuss
report
119
views
Discrete Geometry
»
more
COMPGEOM 2001
»
Walking in a triangulation
13 years 8 months ago
Download
hal.archives-ouvertes.fr
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different
Olivier Devillers, Sylvain Pion, Monique Teillaud
Real-time Traffic
COMPGEOM 2001
|
Discrete Geometry
|
Triangulation
|
claim paper
Related Content
»
The Delaunay Hierarchy
»
Bijective counting of Kreweras walks and loopless triangulations
»
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
»
Tracking across nonoverlapping views via geometry
»
Coloring Eulerian triangulations of the projective plane
»
Expected time analysis for Delaunay point location
»
Measurement Protocols for MediumField Distance Perception in LargeScreen Immersive Display...
»
Preserving Caller Anonymity in VoiceoverIP Networks
more »
Post Info
More Details (n/a)
Added
23 Aug 2010
Updated
23 Aug 2010
Type
Conference
Year
2001
Where
COMPGEOM
Authors
Olivier Devillers, Sylvain Pion, Monique Teillaud
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision