312 search results - page 3 / 63 » An experimental study on algorithms for drawing binary trees |
133
click to vote
COMGEO
2004
ACM
15 years 4 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...
111
click to vote
ICPR
2008
IEEE
15 years 10 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...
131
Voted
APLAS
2003
ACM
15 years 9 months 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 ...
118
click to vote
WEA
2004
Springer
15 years 9 months 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, ...
147
click to vote
GD
1998
Springer
15 years 8 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...