|
Name |
|
Date |
Size |
#Lines |
LOC |
| .. | | 03-May-2022 | - |
| doc/ | H | 03-May-2022 | - | 197 | 157 |
| tests/ | H | 23-May-2021 | - | 103,210 | 80,157 |
| Doxyfile | H A D | 17-May-2021 | 103.3 KiB | 2,424 | 1,873 |
| LICENSE.LGPL | H A D | 17-May-2021 | 23.9 KiB | 461 | 386 |
| Makefile.am | H A D | 17-May-2021 | 1.6 KiB | 92 | 85 |
| README | H A D | 17-May-2021 | 1.5 KiB | 36 | 24 |
| actioninfo.cpp | H A D | 17-May-2021 | 4.4 KiB | 188 | 116 |
| actioninfo.h | H A D | 17-May-2021 | 2.4 KiB | 89 | 47 |
| assertions.h | H A D | 17-May-2021 | 1.4 KiB | 61 | 18 |
| connectionpin.cpp | H A D | 17-May-2021 | 12.8 KiB | 477 | 371 |
| connectionpin.h | H A D | 17-May-2021 | 12.8 KiB | 304 | 90 |
| connector.cpp | H A D | 17-May-2021 | 77.2 KiB | 2,488 | 1,851 |
| connector.h | H A D | 17-May-2021 | 22 KiB | 548 | 200 |
| connend.cpp | H A D | 17-May-2021 | 11.5 KiB | 436 | 321 |
| connend.h | H A D | 17-May-2021 | 9.5 KiB | 268 | 79 |
| debug.h | H A D | 17-May-2021 | 2.3 KiB | 101 | 45 |
| debughandler.h | H A D | 17-May-2021 | 4.1 KiB | 139 | 60 |
| dllexport.h | H A D | 17-May-2021 | 1.1 KiB | 40 | 12 |
| geometry.cpp | H A D | 17-May-2021 | 15.1 KiB | 642 | 365 |
| geometry.h | H A D | 17-May-2021 | 4.4 KiB | 130 | 63 |
| geomtypes.cpp | H A D | 17-May-2021 | 17.7 KiB | 762 | 569 |
| geomtypes.h | H A D | 17-May-2021 | 14.1 KiB | 382 | 109 |
| graph.cpp | H A D | 17-May-2021 | 18.2 KiB | 786 | 576 |
| graph.h | H A D | 17-May-2021 | 3.4 KiB | 136 | 88 |
| hyperedge.cpp | H A D | 17-May-2021 | 12.5 KiB | 389 | 259 |
| hyperedge.h | H A D | 17-May-2021 | 8.6 KiB | 224 | 63 |
| hyperedgeimprover.cpp | H A D | 17-May-2021 | 41.5 KiB | 1,233 | 936 |
| hyperedgeimprover.h | H A D | 17-May-2021 | 5.9 KiB | 160 | 66 |
| hyperedgetree.cpp | H A D | 17-May-2021 | 24 KiB | 822 | 588 |
| hyperedgetree.h | H A D | 17-May-2021 | 4.5 KiB | 144 | 92 |
| junction.cpp | H A D | 17-May-2021 | 6.3 KiB | 234 | 154 |
| junction.h | H A D | 17-May-2021 | 8.2 KiB | 198 | 44 |
| libavoid.h | H A D | 17-May-2021 | 1.6 KiB | 56 | 16 |
| libavoid.pc.in | H A D | 17-May-2021 | 343 | 12 | 11 |
| libavoid.sln | H A D | 17-May-2021 | 14.2 KiB | 197 | 195 |
| libavoid.vcxproj | H A D | 17-May-2021 | 9.2 KiB | 198 | 198 |
| makepath.cpp | H A D | 17-May-2021 | 50.6 KiB | 1,555 | 1,081 |
| makepath.h | H A D | 17-May-2021 | 1.2 KiB | 53 | 19 |
| mtst.cpp | H A D | 17-May-2021 | 35.6 KiB | 1,095 | 741 |
| mtst.h | H A D | 17-May-2021 | 4.3 KiB | 135 | 74 |
| obstacle.cpp | H A D | 17-May-2021 | 7.7 KiB | 356 | 241 |
| obstacle.h | H A D | 17-May-2021 | 4.8 KiB | 151 | 69 |
| orthogonal.cpp | H A D | 17-May-2021 | 115.6 KiB | 3,260 | 2,439 |
| orthogonal.h | H A D | 17-May-2021 | 1 KiB | 40 | 8 |
| router.cpp | H A D | 17-May-2021 | 96.6 KiB | 3,132 | 2,359 |
| router.h | H A D | 17-May-2021 | 37.1 KiB | 889 | 252 |
| scanline.cpp | H A D | 17-May-2021 | 16.6 KiB | 563 | 418 |
| scanline.h | H A D | 17-May-2021 | 3.2 KiB | 137 | 83 |
| shape.cpp | H A D | 17-May-2021 | 8.8 KiB | 281 | 204 |
| shape.h | H A D | 17-May-2021 | 6 KiB | 166 | 50 |
| timer.cpp | H A D | 17-May-2021 | 4.1 KiB | 189 | 131 |
| timer.h | H A D | 17-May-2021 | 2.5 KiB | 105 | 60 |
| vertices.cpp | H A D | 17-May-2021 | 16.7 KiB | 740 | 543 |
| vertices.h | H A D | 17-May-2021 | 6.9 KiB | 227 | 145 |
| viscluster.cpp | H A D | 17-May-2021 | 2.5 KiB | 117 | 60 |
| viscluster.h | H A D | 17-May-2021 | 5.1 KiB | 137 | 33 |
| visibility.cpp | H A D | 17-May-2021 | 19.7 KiB | 677 | 511 |
| visibility.h | H A D | 17-May-2021 | 1.1 KiB | 42 | 8 |
| vpsc.cpp | H A D | 17-May-2021 | 42.4 KiB | 1,501 | 1,162 |
| vpsc.h | H A D | 17-May-2021 | 9.5 KiB | 342 | 250 |
README
1libavoid - Fast, Incremental, Object-avoiding Line Router
2
3Copyright (C) 2004-2009 Monash University
4
5A cross-platform C++ library providing fast, object-avoiding connector
6routing for use in interactive diagram editors.
7
8Documentation is available for libavoid through Doxygen. Install Doxygen and
9run it in the libavoid directory to generate documentation for the interface.
10
11libavoid is written and maintained by Michael Wybrow, a member of the
12Adaptive Diagrams and Documents lab at Monash University, Australia.
13
14libavoid is available under the terms of open-source GNU Lesser General Public
15License v2.1. Commercial licenses are also available, for more information
16please contact Michael Wybrow <http://www.csse.monash.edu.au/~mwybrow/>.
17
18The algorithms used for the connector routing are described in:
19
20 M. Wybrow, K. Marriott, and P.J. Stuckey. Incremental connector routing.
21 In Proceedings of 13th International Symposium on Graph Drawing, LNCS 3843,
22 pages 446-457. Springer-Verlag, 2006.
23 http://www.csse.monash.edu.au/~mwybrow/papers/wybrow-gd-2005.pdf
24
25 M. Wybrow, K. Marriott, and P.J. Stuckey. Orthogonal connector routing.
26 In Proceedings of 17th International Symposium on Graph Drawing (GD '09),
27 To appear 2010.
28 http://www.csse.monash.edu.au/~mwybrow/papers/wybrow-gd-2009.pdf
29
30libavoid is currently used in the prototype research diagram editor "Dunnart":
31 http://www.csse.monash.edu.au/~mwybrow/dunnart/
32As well as the professional open-source vector graphics editor "Inkscape":
33 http://www.inkscape.org/
34
35
36