Sciweavers

1289 search results - page 9 / 258
» On the Minimal Embedding Field
Sort
View
COMPGEOM
2003
ACM
13 years 12 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
COCOON
1999
Springer
13 years 11 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
ESA
2000
Springer
122views Algorithms» more  ESA 2000»
13 years 10 months ago
Minimum Depth Graph Embedding
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
Maurizio Pizzonia, Roberto Tamassia
CSREAESA
2006
13 years 8 months ago
Chip OS: new architecture for next generation embedded system
Nowadays embedded system, hardware/software technology has progressed prosperously. In many field of industrial manufacture and people life, embedded system is indispensable. Rece...
Tianzhou Chen, Yi Lian, Wei Hu

Publication
400views
15 years 1 months ago
Enforcing Integrability by Error Correction using L1-minimization
Surface reconstruction from gradient fields is an important final step in several applications involving gradient manipulations and estimation. Typically, the resulting gradient ...
Dikpal Reddy, Amit K. Agrawal, Rama Chellappa