339 search results - page 32 / 68 » Geometry of Graphs |
168
click to vote
SCIA
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of a multiplicity alpha overlay shadow mo...
153
click to vote
SAC
2009
ACM
16 years 21 days ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
179
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
169
click to vote
RTA
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
147
click to vote
JMM2
2007
15 years 5 months ago
2007
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...