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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
83
Voted
FODO
1989
Springer
89
views
Algorithms
»
more
FODO 1989
»
A Formal Definition of Binary Topological Relationships
15 years 6 months ago
Download
www.spatial.maine.edu
Max J. Egenhofer
Real-time Traffic
Algorithms
|
FODO 1989
|
claim paper
Related Content
»
On the formal points of the formal topology of the binary tree
»
On 3D Topological Relationships
»
Querying Moving Objects with Uncertainty in SpatioTemporal Databases
»
Learning gene regulatory networks from only positive and unlabeled data
more »
Post Info
More Details (n/a)
Added
28 Aug 2010
Updated
28 Aug 2010
Type
Conference
Year
1989
Where
FODO
Authors
Max J. Egenhofer
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision