Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/geoinformatica/PraingS08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/geoinformatica/PraingS08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Markus_Schneider_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Reasey_Praing
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10707-007-0035-y
>
foaf:
homepage
<
https://doi.org/10.1007/s10707-007-0035-y
>
dc:
identifier
DBLP journals/geoinformatica/PraingS08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10707-007-0035-y
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/geoinformatica
>
rdfs:
label
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Markus_Schneider_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Reasey_Praing
>
swrc:
number
3
(xsd:string)
swrc:
pages
313-356
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/geoinformatica/PraingS08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/geoinformatica/PraingS08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/geoinformatica/geoinformatica12.html#PraingS08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10707-007-0035-y
>
dc:
subject
spatial database; complex spatial object; topological predicate; predicate verification; predicate determination; topological feature vector; exploration phase; evaluation phase; nine-intersection matrix characterization; matrix thinning; minimum cost decision tree
(xsd:string)
dc:
title
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
12
(xsd:string)