Re: Using smooth shading

Assuming that for a well connected mesh the number of vertices is
nearly equal to
the number of faces it looks like the algorithm you mention would be
n**2.
This would make it very slow.
A more efficient algorithm is to

scan all vertices such that you cluster vertices with nearly(tolerance)
same position
together. If a vertex sits in a precreated cluster then use that
cluster ID to generate
the vertex ID else create new cluster ID and use that as vertex ID.

This algorithm if implemented correctly could approach n*log(n) .

stanford scanning repository had till sometimes ago ply utils download.
Check
if its still available.

-Valins

.

Relevant Pages

  • Re: Gene expression: Is Natural Selection a tautology?
    ... the Gaia selection force selects. ... cluster of rocks can't imply anything, ... battle between the good and bad algorithm, the strong algorithm won, ... Scientists mostly don't care that much about precise definitions. ...
    (talk.origins)
  • Re: Sequence clustering - order of the model
    ... The research paper for the algorithm is here: ... The algorithm is essentially a mixture of markov and cluster models. ... The input sequence is used to determine the cluster probability of the ...
    (microsoft.public.sqlserver.datamining)
  • Re: Complexity of a specific kind of instances of a NP-complete problem
    ... Here the main point is the size of the cluster. ... algorithm exists by calling them one by one until an answer is obtained. ... > an instance is NPC according current complexity theory. ... > years are needed to resolve it, using computer, mathematics, whatever? ...
    (comp.theory)
  • Re: Using smooth shading
    ... psvalins@xxxxxxxxx ha scritto: ... A more efficient algorithm is to ... scan all vertices such that you cluster vertices with nearly ...
    (comp.graphics.api.opengl)