An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/adcm/LipovetskyD07
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/adcm/LipovetskyD07
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Evgeny_Lipovetsky
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nira_Dyn
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10444-005-7473-6
>
foaf:
homepage
<
https://doi.org/10.1007/s10444-005-7473-6
>
dc:
identifier
DBLP journals/adcm/LipovetskyD07
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10444-005-7473-6
(xsd:string)
dcterms:
issued
2007
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/adcm
>
rdfs:
label
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Evgeny_Lipovetsky
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nira_Dyn
>
swrc:
number
1-3
(xsd:string)
swrc:
pages
269-282
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/adcm/LipovetskyD07/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/adcm/LipovetskyD07
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/adcm/adcm26.html#LipovetskyD07
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10444-005-7473-6
>
dc:
subject
convex polygons; metric average; morphing; linear time complexity
(xsd:string)
dc:
title
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
26
(xsd:string)