Sciweavers

2365 search results - page 109 / 473
» All things are connected
Sort
View
CGI
2004
IEEE
15 years 5 months ago
Consistent Normal Orientation for Polygonal Meshes
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
Pavel Borodin, Gabriel Zachmann, Reinhard Klein
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 1 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
JGT
2006
95views more  JGT 2006»
15 years 1 months ago
Maximal independent sets in graphs with at most r cycles
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vinc...
EJC
2007
15 years 1 months ago
Nonsingular mixed graphs with few eigenvalues greater than two
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mi...
Yi-Zheng Fan, Shi-Cai Gong, Jun Zhou, Ying-Ying Ta...
JCSS
2000
92views more  JCSS 2000»
15 years 1 months ago
Querying Spatial Databases via Topological Invariants
The paper investigates the use of topological annotations (called topological invariants) to answer topological queries in spatial databases. The focus is on the translation of to...
Luc Segoufin, Victor Vianu