Sciweavers

961 search results - page 181 / 193
» Visual Cryptography on Graphs
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
ICFCA
2004
Springer
14 years 1 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
SIGGRAPH
1997
ACM
14 years 6 days ago
Interactive Boolean operations for conceptual design of 3-D solids
Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for inte...
Ari Rappoport, Steven N. Spitz
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
14 years 4 days ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
CF
2007
ACM
14 years 1 days ago
An analysis of the effects of miss clustering on the cost of a cache miss
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...