Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. C / C++ / MFC
  4. Question regarding elliptical fit to raw data points x, y

Question regarding elliptical fit to raw data points x, y

Scheduled Pinned Locked Moved C / C++ / MFC
c++algorithmshelpquestion
4 Posts 2 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • G Offline
    G Offline
    godspeed123
    wrote on last edited by
    #1

    Hi, I need an algorithm that fits an ellipse to x, y points. I looked around online but there is nothing written in C++. Even a methodology to achieve a fit will be good enough and I will be able to write the code. I also have the center position and all the raw data points. I need a best fit ellipse to it. Any help would be greatly appreicated. Thanks

    R 1 Reply Last reply
    0
    • G godspeed123

      Hi, I need an algorithm that fits an ellipse to x, y points. I looked around online but there is nothing written in C++. Even a methodology to achieve a fit will be good enough and I will be able to write the code. I also have the center position and all the raw data points. I need a best fit ellipse to it. Any help would be greatly appreicated. Thanks

      R Offline
      R Offline
      Ravi Bhavnani
      wrote on last edited by
      #2

      If you don't mind playing with matrices, here's[^] a "numerically stable non-iterative algorithm for fitting an ellipse to a set of data points" (method of least squares). /ravi

      My new year resolution: 2048 x 1536 Home | Music | Articles | Freeware ravib(at)ravib(dot)com

      G 1 Reply Last reply
      0
      • R Ravi Bhavnani

        If you don't mind playing with matrices, here's[^] a "numerically stable non-iterative algorithm for fitting an ellipse to a set of data points" (method of least squares). /ravi

        My new year resolution: 2048 x 1536 Home | Music | Articles | Freeware ravib(at)ravib(dot)com

        G Offline
        G Offline
        godspeed123
        wrote on last edited by
        #3

        Hi, I saw this from my searching online, but the problem is none of this makes sense to me. Is there a step by step procedure to solve this problem. Thanks

        R 1 Reply Last reply
        0
        • G godspeed123

          Hi, I saw this from my searching online, but the problem is none of this makes sense to me. Is there a step by step procedure to solve this problem. Thanks

          R Offline
          R Offline
          Ravi Bhavnani
          wrote on last edited by
          #4

          A C implementation of the Levenberg-Marquardt[^] algorithm can be found here[^]. Hope this helps. /ravi

          My new year resolution: 2048 x 1536 Home | Music | Articles | Freeware ravib(at)ravib(dot)com

          1 Reply Last reply
          0
          Reply
          • Reply as topic
          Log in to reply
          • Oldest to Newest
          • Newest to Oldest
          • Most Votes


          • Login

          • Don't have an account? Register

          • Login or register to search.
          • First post
            Last post
          0
          • Categories
          • Recent
          • Tags
          • Popular
          • World
          • Users
          • Groups