107,266 Hits in 5.3 sec

Page 5214 of Mathematical Reviews Vol. , Issue 2002G [page]

2002 Mathematical Reviews  
We consider the problem of finding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5.  ...  Summary: “We describe a multi-scale approach to the problem of drawing undirected graphs ‘nicely’, with the straight-line edge convention.  ... 

2-D Layout for Tree Visualization: a survey

Guanqun Wang, Tsuneo Nakanishi, Akira Fukuda, M. Kavakli, M.J.E. Salami, A. Amini, M.A.B.M. Basri, A.B. Masli, S.C.H. Li, M. Pal
2016 MATEC Web of Conferences  
This is a survey of recent researches on 2D tree visualization approaches.  ...  The whole paper will focus on 2D layouts for general trees including different styles of node-link diagram, main variations of Treemap, some solutions designed especially for mobile devices, and several  ...  tree than the conventional methods.  ... 
doi:10.1051/matecconf/20165601007 fatcat:v6gkn6xbdbgg3ok7vu6koxtooq

Page 1329 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
We also derive some approximation results on partition graph problems by paths.” 2003b:68222 68W25 68Q17 68U0S Penna, Paolo (I-ROME2; Rome) On the approximability of two tree drawing conventions.  ...  Summary: “We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over.  ... 

Dimensioning analysis: toward automatic understanding of engineering drawings

Dov Dori
1992 Communications of the ACM  
Dimensioning in engineering drawings provides an exact definition of the geometry approximated by the geometry entities. Therefore, recognition of dimensions is a key component of MDUS.  ...  that ought to be used (zero, one, or two; if onewhich of the two?)  ...  notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery.  ... 
doi:10.1145/135239.135245 fatcat:iyn6z5ruzzglfiqfzatu6szw44

Approximate Proximity Drawings [chapter]

William Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2012 Lecture Notes in Computer Science  
Intuitively, given a definition of proximity and two real numbers ε1 ≥ 0 and ε2 ≥ 0, an (ε1, ε2)-proximity drawing of a graph is a planar straight-line drawing Γ such that: (i) for every pair of adjacent  ...  We also study the extremal case of (0, ε2)-proximity drawings, which generalizes the well-known weak proximity drawing model.  ...  Similar studies have been described in [10] in the context of drawing a tree as a minimum spanning tree approximation.  ... 
doi:10.1007/978-3-642-25878-7_17 fatcat:ozreaic7r5hhhni2knk42mexfa

Selected Open Problems in Graph Drawing [chapter]

Franz Brandenburg, David Eppstein, Michael T. Goodrich, Stephen Kobourov, Giuseppe Liotta, Petra Mutzel
2004 Lecture Notes in Computer Science  
In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing.  ...  graph G so as to minimize the area of a numberingupward planar drawing of G (taken over all possible numberings of G)?  ...  Acknowledgements We wish to thank Emilio Di Giacomo for useful discussions and comments while preparing this collection of open problems.  ... 
doi:10.1007/978-3-540-24595-7_55 fatcat:4xhjrvq2cffufbfswpjjjtiy3a

Research on Collision Detection in Virtual Measurement Scene

2018 DEStech Transactions on Engineering and Technology Research  
Facing the need of virtual laboratory of engineering drawing, virtual measurement module is developed.  ...  The method of determining the traversal order by the distance of the center of the bounding box is proposed in the process of traversing the tree to reduce the average lookup depth of the bounding box  ...  The principle is two convex polygonal objects, if we can find a shaft, so that the two objects on the axis of the projection does not overlap, then there is no collision between the two objects, the axis  ... 
doi:10.12783/dtetr/ecame2017/18363 fatcat:lwlfpqrluvehbpsxpapcza3pny

Urban Objects Extraction from 3D Laser Point Clouds Acquired by a Static Laser Scanner and a Mobile Mapping System

Mohammed Bendaanane, Kaoutar Eddahmani, Imane Sebari
2015 International Journal of Remote Sensing Application  
The proposed methodology has been tested on two urban street sections of 300 meters length.  ...  Particularly, this research aims to develop a comparative study, of the two methods, according to the conventional method (tachometry measurement).  ...  ACKNOWLEDGMENT The authors would like to thank Mr.  ... 
doi:10.14355/ijrsa.2015.05.004 fatcat:xk3h6heomrgsvhb2wl7p6rt6na

Descriptions and depictions of environments

Holly A. Taylor, Barbara Tversky
1992 Memory & Cognition  
Task expectations, to draw or to describe, had no effects on overall memory, nor did order of performing the two tasks.  ...  Approximately equal numbers of subjects used the other alternatives.  ... 
doi:10.3758/bf03199581 pmid:1453966 fatcat:t6fmg74u75g7jhxlyv6pv7l4ku

A New Method for the Large-Scale Documentation of Pottery Sherds Through Simultaneous Multiple 3D Model Capture Using Structure from Motion: Phoenician Carinated-Shoulder Amphorae from Tell el-Burak (Lebanon) as a Case Study

Fanet Göttlich, Aaron Schmitt, Andrea Kilian, Helen Gries, Kamal Badreshany
2021 Open Archaeology  
of the drawings.  ...  The method has great potential to enhance and replace time-consuming and expensive conventional approaches for pottery documentation, i.e., 2D photographs and drawing on paper with subsequent digitization  ...  Acknowledgments: The participation of Andrea Kilian from JGU Mainz was supported by the GRF long-term project "The Ancient Necropolis of Asyut: Documentation and Interpretation."  ... 
doi:10.1515/opar-2020-0133 fatcat:vlsan7fozjcvlc5wab3o55hpxe

Leghemoglobins: Immunochemistry and phylogenetic relationships

John G.R. Hurrell, Keith R. Thulborn, William J. Broughton, Michael J. Dilworth, Sydney J. Leach
1977 FEBS Letters  
Conventional Taxonomy From the immunological data presented, it is possible to draw up several phylogenetic trees based on cross-reactivity.  ...  The simplest of these trees is shown in fig,3 and is in good agreement with the phylogenetic tree based on conventional taxonomic criteria.  ... 
doi:10.1016/0014-5793(77)80698-4 pmid:598505 fatcat:rgorqlikb5dlrjmxoa77zwwjyq

Approximate and probabilistic algorithms for shading and rendering structured particle systems

William T. Reeves, Ricki Blau
1985 Proceedings of the 12th annual conference on Computer graphics and interactive techniques - SIGGRAPH '85  
We describe approximate and probabilistic algorithms for shading and the visible surface problem.  ...  We analyze the performance of our current algorithms to understand the costs of our stochastic modelling approach.  ...  Draw Particles The" final phase takes as input the description of particle primitives in two-dimensional screen coordinates and draws the primitives into the frame buffer.  ... 
doi:10.1145/325334.325250 dblp:conf/siggraph/ReevesB85 fatcat:lcoorgyqtnendgwdrl2o3lptci

Towards content-based retrieval of technical drawings through high-dimensional indexing

Manuel J Fonseca, Joaquim A Jorge
2003 Computers & graphics  
We describe in detail the indexing structure (NB-Tree) we have developed within the context of a more general approach.  ...  This contrasts with conventional approaches which use mostly textual metadata for the same purpose.  ...  Present-day CAD systems rely on conventional database queries and direct-manipulation to achieve this. Some of the solutions [1, 10] to this problem use textual databases to organize the information.  ... 
doi:10.1016/s0097-8493(02)00244-3 fatcat:pguzxfeomnewxgtyj4rhons67q

Power distribution topology design

Ashok Vittal, Malgorzata Marek-Sadowska
1995 Proceedings of the 32nd ACM/IEEE conference on Design automation conference - DAC '95  
We propose topology design of power distribution nets using a novel method for capturing the temporal characteristics of sink currents -the current compatibility graph.  ...  Our techniques result in significant area improvements on benchmark instances.  ...  The use of the current compatibility graph affects the structure of optimal solutions. For instance, the merging of two sub-trees which never draw current at the same time would be preferred.  ... 
doi:10.1145/217474.217578 dblp:conf/dac/VittalM95a fatcat:p32ov5ty4veyrdxl4lslxhipmi

Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem [chapter]

Lan Liu, Xi Chen, Jing Xiao, Tao Jiang
2005 Lecture Notes in Computer Science  
We prove that MRHC on two-locus pedigrees or binary-tree pedigrees with missing data cannot be approximated (the formal definition is given in section 1.2) unless P=NP.  ...  We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant principle (MRHC).  ...  This research is supported in part by NSF grant CCR-0309902, National KeyProject for Basic Research (973) grant 2002CB512801, and a fellowship from the Center for Advanced Study, Tsinghua University.  ... 
doi:10.1007/11602613_38 fatcat:lpdhtf7gvbflnmyqygqh4zl24y
« Previous Showing results 1 — 15 out of 107,266 results