Sciweavers

113 search results - page 2 / 23
» When can a graph form an orthogonal polyhedron
Sort
View
FSTTCS
2004
Springer
14 years 22 days ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...
WSCG
2000
107views more  WSCG 2000»
13 years 8 months ago
Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
Antonio Aguilera, Dolors Ayala
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 7 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
13 years 11 months ago
Translating Out of Static Single Assignment Form
Programs represented in Static Single Assignment (SSA) form contain phi instructions (or functions) whose operational semantics are to merge values coming from distinct control flo...
Vugranam C. Sreedhar, Roy Dz-Ching Ju, David M. Gi...
GD
1995
Springer
13 years 11 months ago
Graph Layout Adjustment Strategies
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...
Margaret-Anne D. Storey, Hausi A. Müller