312 search results - page 3 / 63 » An experimental study on algorithms for drawing binary trees |
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Removing noise in engineering drawing images is important before applying image analysis processes. Noise should be removed while keeping the fine detail of the image intact. A n...
APLAS
2003
ACM
14 years 21 days ago
2003
ACM
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
WEA
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...