Jump to content

  • Log In with Google      Sign In   
  • Create Account


#Actualtaby

Posted 01 May 2013 - 03:53 PM

Another simple smoothing algorithm to try is where the scale is multiplied by a factor related to each vertex's angle deficit (curvature), ie.:

 

vertex[i] += displacement[i]*scale*((2pi - total_angle[i])/(2pi)).

 

This should smooth out spikes and pits, but leave ridges, valleys and flat regions relatively untouched -- which seems ideal for the task at hand.

 

Not sure what the algorithm's called, nor how much it would differ from the curvature normal weighting, but will try later today.

 

Update:  implemented as suggested, it doesn't work entirely as expected, but will try other things related to it.


#11taby

Posted 29 April 2013 - 11:44 AM

Another simple smoothing algorithm to try is where the scale is multiplied by a factor related to each vertex's angle deficit (curvature), ie.:

 

vertex[i] += displacement[i]*scale*((2pi - total_angle[i])/(2pi)).

 

This should smooth out spikes and pits, but leave ridges, valleys and flat regions relatively untouched -- which seems ideal for the task at hand.

 

Not sure what the algorithm's called, nor how much it would differ from the curvature normal weighting, but will try later today.


#10taby

Posted 29 April 2013 - 11:44 AM

Another simple smoothing algorithm to try is where the scale is multiplied by a factor related to each vertex's angle deficit (curvature), ie.:

 

vertex[i] += displacement[i]*scale*((2pi - total_angle[i])/(2pi)).

 

This should smooth out pits and spikes, but leave ridges, valleys and flat regions relatively untouched -- which seems ideal for the task at hand.

 

Not sure what the algorithm's called, nor how much it would differ from the curvature normal weighting, but will try later today.


#9taby

Posted 29 April 2013 - 11:43 AM

Another simple smoothing algorithm to try is where the scale is multiplied by a factor related to each vertex's angle deficit (curvature), ie.:

 

vertex[i] += displacement[i]*scale*((2pi - total_angle[i])/(2pi)).

 

This should smooth out pits and spikes, but leave ridges, valleys and flat regions relatively untouched -- which seems ideal for the task at hand. Not sure what the algorithm's called, nor how much it would differ from the curvature normal weighting, but will try later today.


#8taby

Posted 29 April 2013 - 11:43 AM

Another simple smoothing algorithm to try is where the scale is multiplied by a factor related to the angle deficit (curvature) of the vertex, ie. vertex[i] += displacement[i]*scale*((2pi - total_angle[i])/(2pi)).

 

This should smooth out pits and spikes, but leave ridges, valleys and flat regions relatively untouched -- which seems ideal for the task at hand. Not sure what the algorithm's called, nor how much it would differ from the curvature normal weighting, but will try later today.


#7taby

Posted 29 April 2013 - 11:41 AM

Another simple smoothing algorithm to try is where the scale is multiplied by a factor related to the angle deficit of the vertex, ie. vertex[i] += displacement[i]*scale*((2pi - total_angle[i])/(2pi)).

 

This should smooth out pits and spikes, but leave ridges, valleys and flat regions relatively untouched -- which seems ideal for the task at hand. Not sure what the algorithm's called, but will try later today.


PARTNERS