๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polygonal path simplification with angle constraints

โœ Scribed by Danny Z. Chen; Ovidiu Daescu; John Hershberger; Peter M. Kogge; Ningfang Mi; Jack Snoeyink

Book ID
108100933
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
190 KB
Volume
32
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Regular Path Queries with Constraints
Regular Path Queries with Constraints
โœ Serge Abiteboul; Victor Vianu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 310 KB

The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered. The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries. In particular, decidability and complexity

Time-varying shortest path problems with
Time-varying shortest path problems with constraints
โœ Cai, X.; Kloks, T.; Wong, C. K. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 159 KB

We study a new version of the shortest path problem. Let G ร… (V, E) be a directed graph. Each arc e โˆš E has two numbers attached to it: a transit time b(e, u) and a cost c(e, u), which are functions of the departure time u at the beginning vertex of the arc. Moreover, postponement of departure (i.e.