Search for Author All Reviews
	Sack, Jorg     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews       Shortest paths in time-dependent FIFO networks Dehne F., Omran M., Sack J. Algorithmica 62(1-2): 416-435, 2012.  Type: Article The natural goal of routing algorithms is to identify the least costly paths between sources and destinations. When costs are related to distances, as they frequently are, the least costly paths become the shortest paths. This paper pr...... Jun 19 2012     Generating triangulations at random Epstein P., Sack J. ACM Transactions on Modeling and Computer Simulation 4(3): 267-278, 1994.  Type: Article Two polynomial-time algorithms are presented. The first counts the triangulations of a simple plane polygon having no holes or self-intersections. The other generates such triangulations with uniform probability distribution (every tri...... Nov 1 1995     Computational Geometry: Theory and Applications (v.1 n.1) Sack J. Urrutia J. (ed)  Computational Geometry: Theory and Applications 11:1991.  Type: Journal In a 1989 survey talk, I predicted that two new journals devoted to computational geometry would appear within a decade. My prediction was realized in under two years, with the publication of the International Journal of Computation...... Sep 1 1993     Algorithms for minimum length partitions of polygons Lingas A., Levcopoulos C., Sack J. BIT 27(4): 474-479, 1987.  Type: Article The authors present a compact description of an algorithm of time complexity O(n3m2) for finding a minimum length diagonal partition of a simple polygon into faces under two conditions: either...... Jun 1 1989
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy