Downloads provided by UsageCounts
handle: 2117/84373
This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated to each point of the plane. The pseudo-code of the procedures involved in the algorithms is included, the suitability of the algorithms is analyzed, and several examples are presented.
:Informàtica::Infografia [Àrees temàtiques de la UPC], Elliptical distances, Constrained Delaunay triangulations, Àrees temàtiques de la UPC::Informàtica::Infografia
:Informàtica::Infografia [Àrees temàtiques de la UPC], Elliptical distances, Constrained Delaunay triangulations, Àrees temàtiques de la UPC::Informàtica::Infografia
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 23 | |
| downloads | 23 |

Views provided by UsageCounts
Downloads provided by UsageCounts