Jump to content


Surface generation


  • You cannot reply to this topic
7 replies to this topic

#1 krafty

    New Member

  • Members
  • PipPip
  • 13 posts

Posted 27 July 2007 - 06:35 AM

Hello,
I am trying to experiment with generating meshes out of vertex information only, is anyone having any ideas how one should go about it ...
There are a few techniques like generating a parametric surface and then triangulate ...

#2 Sol_HSA

    Senior Member

  • Members
  • PipPipPipPip
  • 482 posts
  • LocationNowhere whenever

Posted 27 July 2007 - 07:42 AM

Connect the dots..

Without any other information but a bunch of vertices, you can end up with just about anything.
http://iki.fi/sol - my schtuphh

#3 krafty

    New Member

  • Members
  • PipPip
  • 13 posts

Posted 27 July 2007 - 09:16 AM

correct, but there are a few techniques that can generate a good enough surface ...

#4 krafty

    New Member

  • Members
  • PipPip
  • 13 posts

Posted 27 July 2007 - 09:49 AM

actually there is a lesser chance of landing up with an unexpected object, since it is going to be a surface

#5 geon

    Senior Member

  • Members
  • PipPipPipPip
  • 893 posts

Posted 27 July 2007 - 02:39 PM

If your data is pretty smooth, you could try starting from a random (reasonable) triangle and connect all edges to one more point, with the constraint of being close (decided by the distance and a threshold?) and g1 continuous (decided by the angle between the new triangle and the old?).

#6 Dim_Yimma_H

    Member

  • Members
  • PipPip
  • 49 posts

Posted 27 July 2007 - 03:47 PM

Have you taken a look on the marching cubes algorithm for generating a surface of volumetric data? Here's a link to a description by Paul Bourke: http://local.wasp.uw...try/polygonise/

#7 z80

    Valued Member

  • Members
  • PipPipPip
  • 104 posts

Posted 27 July 2007 - 06:52 PM

Marching cubes is best when you have a clear definition of inside and outside for a given point i belive.

I think the term for "vertex information only" is a "point cloud".. Should make it easier to search.

Also this one might be helpful:
http://www.cs.sunysb...man_Vis2005.pdf

#8 krafty

    New Member

  • Members
  • PipPip
  • 13 posts

Posted 30 July 2007 - 03:12 AM

Yes,
great I was just about to post about Marching cubes and Marching tetraheds algo, its very good.

I am trying it out... will post if it works out good, another way btw, is Voroni, Delauny triangulation something on similar lines to what geon was saying ...

but Marching looks good at the moment

cheers





1 user(s) are reading this topic

0 members, 1 guests, 0 anonymous users