/dports/shells/ion/ion-a8872014dbce730ccd00aaa722397dc394a52bf4/cargo-crates/line_drawing-0.7.0/ |
H A D | README.md | 8 * `Bresenham` - An implementation of [Bresenham's line algorithm]. 10 * `BresenhamCircle` - Bresenham's circle algorithm. 16 [Bresenham's line algorithm]: https://en.wikipedia.org/wiki/Bresenham's_line_algorithm
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/line_drawing-0.7.0/ |
H A D | README.md | 8 * `Bresenham` - An implementation of [Bresenham's line algorithm]. 10 * `BresenhamCircle` - Bresenham's circle algorithm. 16 [Bresenham's line algorithm]: https://en.wikipedia.org/wiki/Bresenham's_line_algorithm
|
/dports/games/dose-response/dose-response-179c326/cargo-crates/line_drawing-0.7.0/ |
H A D | README.md | 8 * `Bresenham` - An implementation of [Bresenham's line algorithm]. 10 * `BresenhamCircle` - Bresenham's circle algorithm. 16 [Bresenham's line algorithm]: https://en.wikipedia.org/wiki/Bresenham's_line_algorithm
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/angle/src/libANGLE/renderer/vulkan/doc/ |
H A D | OpenGLLineSegmentRasterization.md | 10 OpenGL's algorithm is based on [Bresenham's line algorithm][Bresenham]. Bresenham's algorithm 11 selects pixels on the line between the two segment points. Note Bresenham's does not support 32 non-Bresenham fragments when both intersections are outside the diamond. 62 ![Holes in the emulated Bresenham line][Holes] 64 Therefore for a complete implementation we require the Bresenham line 68 [Bresenham]: https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/src/libANGLE/renderer/vulkan/doc/ |
H A D | OpenGLLineSegmentRasterization.md | 10 OpenGL's algorithm is based on [Bresenham's line algorithm][Bresenham]. Bresenham's algorithm 11 selects pixels on the line between the two segment points. Note Bresenham's does not support 32 non-Bresenham fragments when both intersections are outside the diamond. 62 ![Holes in the emulated Bresenham line][Holes] 64 Therefore for a complete implementation we require the Bresenham line 68 [Bresenham]: https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm
|
/dports/shells/ion/ion-a8872014dbce730ccd00aaa722397dc394a52bf4/cargo-crates/line_drawing-0.7.0/src/ |
H A D | bresenham.rs | 27 pub struct Bresenham<T> { struct 36 impl<T: SignedNum> Bresenham<T> { argument 62 impl<T: SignedNum> Iterator for Bresenham<T> { implementation 88 Bresenham::new((0, 0), (5, 5)).collect::<Vec<_>>(), in test()
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/line_drawing-0.7.0/src/ |
H A D | bresenham.rs | 27 pub struct Bresenham<T> { struct 36 impl<T: SignedNum> Bresenham<T> { argument 62 impl<T: SignedNum> Iterator for Bresenham<T> { implementation 88 Bresenham::new((0, 0), (5, 5)).collect::<Vec<_>>(), in test()
|
/dports/games/dose-response/dose-response-179c326/cargo-crates/line_drawing-0.7.0/src/ |
H A D | bresenham.rs | 27 pub struct Bresenham<T> { struct 36 impl<T: SignedNum> Bresenham<T> { implementation 62 impl<T: SignedNum> Iterator for Bresenham<T> { implementation 88 Bresenham::new((0, 0), (5, 5)).collect::<Vec<_>>(), in test()
|
/dports/graphics/p5-Algorithm-Line-Bresenham/Algorithm-Line-Bresenham-0.11/ |
H A D | META.yml | 2 name: Algorithm-Line-Bresenham 12 Algorithm::Line::Bresenham: 13 file: lib/Algorithm/Line/Bresenham.pm
|
/dports/print/texlive-base/texlive-20150521-source/texk/ps2pk/ |
H A D | lines.c | 75 static void Bresenham(pel *, fractpel, fractpel, fractpel, fractpel); 101 Bresenham(R->edge, x2, y2, x1, y1); in StepLine() 103 Bresenham(R->edge, x1, y1, x2, y2); in StepLine() 130 static void Bresenham( in Bresenham() function
|
/dports/shells/ion/ion-a8872014dbce730ccd00aaa722397dc394a52bf4/cargo-crates/line_drawing-0.7.0/examples/ |
H A D | image.rs | 47 Bresenham::new((10, 165), (170, 290)), in main() 54 draw_line(&mut image, Bresenham::new(a, b), [255, 0, 0]); in main() 55 draw_line(&mut image, Bresenham::new(b, a), [0, 128, 255]); in main()
|
H A D | bresenham.rs | 2 use line_drawing::Bresenham; 5 for (x, y) in Bresenham::new((0, 0), (5, 6)) { in main()
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/line_drawing-0.7.0/examples/ |
H A D | image.rs | 47 Bresenham::new((10, 165), (170, 290)), in main() 54 draw_line(&mut image, Bresenham::new(a, b), [255, 0, 0]); in main() 55 draw_line(&mut image, Bresenham::new(b, a), [0, 128, 255]); in main()
|
H A D | bresenham.rs | 2 use line_drawing::Bresenham; 5 for (x, y) in Bresenham::new((0, 0), (5, 6)) { in main()
|
/dports/games/dose-response/dose-response-179c326/cargo-crates/line_drawing-0.7.0/examples/ |
H A D | image.rs | 47 Bresenham::new((10, 165), (170, 290)), in main() 54 draw_line(&mut image, Bresenham::new(a, b), [255, 0, 0]); in main() 55 draw_line(&mut image, Bresenham::new(b, a), [0, 128, 255]); in main()
|
H A D | bresenham.rs | 2 use line_drawing::Bresenham; 5 for (x, y) in Bresenham::new((0, 0), (5, 6)) { in main()
|
/dports/shells/ion/ion-a8872014dbce730ccd00aaa722397dc394a52bf4/cargo-crates/line_drawing-0.7.0/benches/ |
H A D | benchmarks.rs | 24 bencher.iter(|| black_box(Bresenham::new(START, END))); in bench_bresenham() 29 bencher.iter(|| black_box(bresenham::Bresenham::new(START, END))); in bench_bresenham_crate() 70 bencher.iter(|| black_box(Bresenham::new(START, END).steps())); in bench_steps_bresenham()
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/line_drawing-0.7.0/benches/ |
H A D | benchmarks.rs | 24 bencher.iter(|| black_box(Bresenham::new(START, END))); in bench_bresenham() 29 bencher.iter(|| black_box(bresenham::Bresenham::new(START, END))); in bench_bresenham_crate() 70 bencher.iter(|| black_box(Bresenham::new(START, END).steps())); in bench_steps_bresenham()
|
/dports/devel/t1lib/t1lib-5.1.2/lib/type1/ |
H A D | lines.c | 99 Bresenham(R->edge, x2, y2, x1, y1); 101 Bresenham(R->edge, x1, y1, x2, y2); 128 void Bresenham(edgeP,x1,y1,x2,y2) in Bresenham() function
|
/dports/games/dose-response/dose-response-179c326/cargo-crates/line_drawing-0.7.0/benches/ |
H A D | benchmarks.rs | 24 bencher.iter(|| black_box(Bresenham::new(START, END))); in bench_bresenham() 29 bencher.iter(|| black_box(bresenham::Bresenham::new(START, END))); in bench_bresenham_crate() 70 bencher.iter(|| black_box(Bresenham::new(START, END).steps())); in bench_steps_bresenham()
|
/dports/net/tightvnc/vnc_unixsrc/Xvnc/lib/font/Type1/ |
H A D | lines.c | 95 Bresenham(R->edge, x2, y2, x1, y1); 97 Bresenham(R->edge, x1, y1, x2, y2); 124 void Bresenham(edgeP,x1,y1,x2,y2) in Bresenham() function
|
/dports/math/grace/grace-5.1.25/T1lib/type1/ |
H A D | lines.c | 98 Bresenham(R->edge, x2, y2, x1, y1); 100 Bresenham(R->edge, x1, y1, x2, y2); 127 void Bresenham(edgeP,x1,y1,x2,y2) in Bresenham() function
|
/dports/cad/sumo/sumo-1.2.0/src/utils/geom/ |
H A D | Makefile.am | 4 Bresenham.cpp Bresenham.h GeomConvHelper.cpp GeomConvHelper.h \
|
/dports/graphics/p5-Algorithm-Line-Bresenham/ |
H A D | .license-catalog.mk | 9 _LICENSE_DISTFILES_ART10 =Algorithm-Line-Bresenham-0.11.tar.gz 13 _LICENSE_DISTFILES_GPLv1+ =Algorithm-Line-Bresenham-0.11.tar.gz
|
/dports/www/beehive/beehive-0.4.0/vendor/github.com/wcharczuk/go-chart/drawing/ |
H A D | line.go | 11 Bresenham(img, c, int(s[i-2]+0.5), int(s[i-1]+0.5), int(s[i]+0.5), int(s[i+1]+0.5)) 16 func Bresenham(img draw.Image, color color.Color, x0, y0, x1, y1 int) { func
|