DZone
Thanks for visiting DZone today,
Edit Profile
  • Manage Email Subscriptions
  • How to Post to DZone
  • Article Submission Guidelines
Sign Out View Profile
  • Post an Article
  • Manage My Drafts
Newsletter
Log In / Join
Refcards Trend Reports
Events Video Library
Refcards
Trend Reports

Events

View Events Video Library

Related

  • Building a High-Throughput Distributed Sequence Generator Using the Hi-Lo Algorithm
  • The Quantum Computing Mirage: What Three Years of Broken Promises Have Taught Me
  • Discover Hidden Patterns with Intelligent K-Means Clustering
  • Mastering Approximate Top K: Choosing Optimal Count-Min Sketch Parameters

Trending

  • SSRF Prevention in C#: Securing File Imports From User-Supplied URLs
  • Beyond @Transactional: Solving the Dual-Write Problem in Distributed Microservices
  • Java 8 Optional - Avoid Null and NullPointerException Altogether - and Keep It Pretty
  • Introducing senro: A Pipeline Engine You Program in Go

Draft This article hasn't been published, so readers can't see it.

In moderation This article is waiting for review, so readers can't see it yet.

Deleted This article has been deleted, so readers can't see it.

  1. DZone
  2. Data Engineering
  3. AI/ML
  4. Draw, Plot 2d Line In C# (csharp) - Bresenham's Line Algorithm

Draw, Plot 2d Line In C# (csharp) - Bresenham's Line Algorithm

By 
Snippets Manager
·
Apr. 26, 07 · Code Snippet
Post on X (opens in a new tab) Share on LinkedIn (opens in a new tab)
4.1K Views

Join the DZone community Save articles, join the discussion, and download Refcards and Trend Reports with a free account.

Join for free Already a member? Log in
based on wikipedia

    public interface ISetPixel
    {
        void SetPixel(Point point);
    }
    public partial class Algorithms2D
    {
        public delegate void SetPixel(Point point);
        public static void Line(Point p0,Point p1,G plot)
            where G:ISetPixel
        {
            int x0=p0.X;
            int y0=p0.Y;
            int x1=p1.X;
            int y1=p1.Y;
            bool steep=abs(y1-y0)>abs(x1-x0);
            if (steep)
            {
                swap(ref x0,ref y0);
                swap(ref x1,ref y1);
            }
            if (x0>x1)
            {
                swap(ref x0,ref x1);
                swap(ref y0,ref y1);
            }
            int deltax=x1-x0;
            int deltay=abs(y1-y0);
            int error=-deltax/2;
            int ystep;
            int y=y0;
            if (y00)
                {
                    y=y+ystep;
                    error=error-deltax;
                }
            }
        }
        struct CSetPixel:ISetPixel
        {
            public CSetPixel(SetPixel setPixel)
            {
                this.setPixel=setPixel;
            }
            SetPixel setPixel;
            #region ISetPixel Members
            public void SetPixel(Point point)
            {
                setPixel(point);
            }
            #endregion
        }
        public static void Line(Point p0,Point p1,SetPixel plot)
        {
            Line(p0,p1,new CSetPixel(plot));
        }
        private static int abs(int p)
        {
            return Math.Abs(p);
        }
        private static void swap(ref T x0,ref T y0)
        {
            T z=x0;
            x0=y0;
            y0=z;
        }
    }


unit tests (c# 3.0):


    [TestFixture]
    public class Line
    {
        [Test]
        public void LineDiagonal()
        {
            List l = new List();
            Algorithms2D.Line(new Point(0,0),new Point(3,3),z=>l.Add(z));
            Assert.AreEqual(3, l.Count);
            Assert.AreEqual(new Point(0, 0), l[0]);
            Assert.AreEqual(new Point(1, 1), l[1]);
            Assert.AreEqual(new Point(2, 2), l[2]);
        }
        [Test]
        public void Line45()
        {
            List l = new List();
            Algorithms2D.Line(new Point(0, 0),new Point(6, 3), z => l.Add(z));
            Assert.AreEqual(6, l.Count);
            Assert.AreEqual(new Point(0, 0), l[0]);
            Assert.AreEqual(new Point(1, 0), l[1]);
            Assert.AreEqual(new Point(2, 1), l[2]);
            Assert.AreEqual(new Point(3, 1), l[3]);
            Assert.AreEqual(new Point(4, 2), l[4]);
            Assert.AreEqual(new Point(5, 2), l[5]);
        }
    }
Algorithm

Opinions expressed by DZone contributors are their own.

Related

  • Building a High-Throughput Distributed Sequence Generator Using the Hi-Lo Algorithm
  • The Quantum Computing Mirage: What Three Years of Broken Promises Have Taught Me
  • Discover Hidden Patterns with Intelligent K-Means Clustering
  • Mastering Approximate Top K: Choosing Optimal Count-Min Sketch Parameters

Partner Resources

×

Comments

Loading comments

The comments didn't load

Please try again in a moment.

Likes

Loading

The next likes didn't load. Please try again.

The likes didn't load

Please try again in a moment.

See who liked this

Log in or join DZone for free to see who liked this article.

Log in Join for free
  • RSS
  • X
  • Facebook

ABOUT US

  • About DZone
  • Support and feedback
  • Community research

ADVERTISE

  • Advertise with DZone

CONTRIBUTE ON DZONE

  • Article Submission Guidelines
  • Become a Contributor
  • Core Program
  • Visit the Writers' Zone

LEGAL

  • Terms of Service
  • Privacy Policy

CONTACT US

  • 3343 Perimeter Hill Drive
  • Suite 215
  • Nashville, TN 37211
  • [email protected]

Let's be friends:

  • RSS
  • X
  • Facebook