84 search results - page 1 / 17 » Connected Rectilinear Graphs on Point Sets |
65
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
112
Voted
TCAD
2008
15 years 11 days ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
104
click to vote
ASPDAC
2001
ACM
15 years 4 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
98
Voted
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
127
Voted
TCAD
2008
15 years 11 days ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...