Sciweavers

6740 search results - page 253 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
TVCG
2012
182views Hardware» more  TVCG 2012»
13 years 3 months ago
Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
Kun-Chuan Feng, Chaoli Wang, Han-Wei Shen, Tong-Ye...
89
Voted
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 6 months ago
Geometric Reformulation of 3-Fingered Force-Closure Condition
— This paper addresses the problem of testing whether three contact points form a 3-fingered force-closure grasp in two dimensions. In particular, assuming frictional point cont...
Attawith Sudsang, Thanathorn Phoka
109
Voted
BIRTHDAY
2003
Springer
15 years 6 months ago
Sweepline the Music!
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
Esko Ukkonen, Kjell Lemström, Veli Mäkin...
73
Voted
IJCM
2002
68views more  IJCM 2002»
15 years 16 days ago
Computing an Optimal Hatching Direction in Layered Manufacturing
In Layered Manufacturing (LM), a prototype of a virtual polyhedral object is built by slicing the object into polygonal layers, and then building the layers one after another. In ...
Jörg Schwerdt, Michiel H. M. Smid, Man Chung ...
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 4 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin