# Fast and exact geodesic computation using Edge-based Windows Grouping

@inproceedings{Qin2017FastAE, title={Fast and exact geodesic computation using Edge-based Windows Grouping}, author={Yipeng Qin}, year={2017} }

- Published 2017

Computing discrete geodesic distance over triangle meshes is one of the fundamental problems in computational geometry and computer graphics. As the “Big Data Era” arrives, a fast and accurate solution to the geodesic computation problem on large scale models with constantly increasing resolutions is desired. However, it is still challenging to deal with the speed, memory cost and accuracy of the geodesic computation at the same time. This thesis addresses the aforementioned challenge by… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 78 REFERENCES

## Polyline-sourced Geodesic Voronoi Diagrams on Triangle Meshes

VIEW 1 EXCERPT

HIGHLY INFLUENTIAL

## Construction of Iso-Contours, Bisectors, and Voronoi Diagrams on Triangulated Surfaces

VIEW 1 EXCERPT

HIGHLY INFLUENTIAL