Sciweavers

1801 search results - page 17 / 361
» Pointing without a pointer
Sort
View
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
13 years 11 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
SIGGRAPH
1995
ACM
13 years 11 months ago
An interactive tool for placing curved surfaces without interpenetration
We present a surface representation and a set of algorithms that allow interactive placement of curved parametric objects without interpenetration. Using these algorithms, a model...
John M. Snyder
UIST
2010
ACM
13 years 5 months ago
Imaginary interfaces: spatial interaction with empty hands and without visual feedback
Screen-less wearable devices allow for the smallest form factor and thus the maximum mobility. However, current screen-less devices only support buttons and gestures. Pointing is ...
Sean Gustafson, Daniel Bierwirth, Patrick Baudisch

Book
1902views
15 years 6 months ago
Topology Without Tears
This is beautifully written book on topology. Author has motivated the subject very nicely with lot of examples. The book covers the following topics: Topology Spaces, The Euclidea...
SIDNEY A. MORRIS
ICSE
1998
IEEE-ACM
14 years 6 hour ago
Reuse-Driven Interprocedural Slicing
Program slicing, a technique to compute the subset of program statements that can affect the value of a program variable at a specific program point, is widely used in tools to su...
Mary Jean Harrold, Ning Ci