Approximating polygons and subdivisions with minimum link paths (English)
National licence
- New search for: Guibas, Leonidas J.
- New search for: Hershberger, John E.
- New search for: Mitchell, Joseph S. B.
- New search for: Snoeyink, Jack Scott
- New search for: Guibas, Leonidas J.
- New search for: Hershberger, John E.
- New search for: Mitchell, Joseph S. B.
- New search for: Snoeyink, Jack Scott
In:
ISA'91 Algorithms
;
151-162
;
1991
- Article/Chapter (Book) / Electronic Resource
-
Title:Approximating polygons and subdivisions with minimum link paths
-
Contributors:Guibas, Leonidas J. ( author ) / Hershberger, John E. ( author ) / Mitchell, Joseph S. B. ( author ) / Snoeyink, Jack Scott ( author )
-
Published in:ISA'91 Algorithms ; 151-162Lecture Notes in Computer Science ; 557 ; 151-162
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1991-01-01
-
Size:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Decision-making with incomplete informationPapadimitriou, Christos H. et al. | 1991
- 2
-
Maximum independet set of a permutation graph in k tracksLee, D. T. / Sarrafzadeh, Majid et al. | 1991
- 12
-
Algorithms for square roots of graphsLin, Yaw-Ling / Skiena, Steven S. et al. | 1991
- 22
-
Distributed k-mutual exclusion problem and k-coteriesFujita, Satoshi / Yamashita, Masafumi / Ae, Tadashi et al. | 1991
- 32
-
Is the shuffle-exchange better than the butterfly?Raghunathan, Arvind / Saran, Huzur et al. | 1991
- 42
-
Weighted random assignments with application to hashingYao, Andrew Chi-Chih et al. | 1991
- 43
-
Scheduling file transfers under port and channel constraintsNakano, Shin-ichi / Nishizeki, Takao et al. | 1991
- 52
-
Substitution decomposition on chordal graphs and applicationsHsu, Wen-Lian / Ma, Tze-Heng et al. | 1991
- 61
-
Mixed-searching and proper-path-widthTakahashi, Atsushi / Ueno, Shuichi / Kajitani, Yoji et al. | 1991
- 72
-
Short wire routing in convex gridsWagner, Frank / Wolfers, Barbara et al. | 1991
- 83
-
A new approach to knock-knee channel routingWagner, Dorothea et al. | 1991
- 94
-
Circuit partitioning algorithms: Graph model versus geometry modelAsano, Tetsuo / Tokuyama, Takeshi et al. | 1991
- 104
-
Identifying 2-monotonic positive boolean functions in polynomial timeBoros, E. / Hammer, P. L. / Ibaraki, T. / Kawakami, K. et al. | 1991
- 116
-
An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithmHu, T. H. / Tang, C. Y. / Lee, R. C. T. et al. | 1991
- 127
-
An on-line algorithm for navigating in unknown terrainChan, Kwong-fai / Lam, Tak Wah et al. | 1991
- 137
-
On maintaining the width and diameter of a planar point-set onlineJanardan, Ravi et al. | 1991
- 150
-
Optimal triangulations by retriangulatingEdelsbrunner, Herbert et al. | 1991
- 151
-
Approximating polygons and subdivisions with minimum link pathsGuibas, Leonidas J. / Hershberger, John E. / Mitchell, Joseph S. B. / Snoeyink, Jack Scott et al. | 1991
- 163
-
An incremental algorithm for constructing shortest watchman routesTan, Xue-Hou / Hirata, Tomio / Inagaki, Yasuyoshi et al. | 1991
- 176
-
On hitting grid points in a convex polygon with straight linesLee, H. S. / Chang, R. C. et al. | 1991
- 190
-
On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphsBenkouar, A. / Manoussakis, Y. G. / Paschos, V. Th. / Saad, R. et al. | 1991
- 199
-
Dynamic programming on intervalsAsano, Takao et al. | 1991
- 208
-
Combinatorial optimization through order statisticsSzpankowski, Wojciech et al. | 1991
- 218
-
Combinatorics and algorithms of geometric arrangementsGuibas, Leonidas J. et al. | 1991
- 219
-
An analysis of randomized shear sort on the mesh computerHasegawa, Susumu / Imai, Hiroshi / Hakata, Koji et al. | 1991
- 229
-
Efficient parallel divide-and-conquer for a class of interconnection topologiesWu, I-Chen et al. | 1991
- 241
-
Optimal specified root embedding of full binary trees in faulty hypercubesChan, M. Y. / Chin, F. Y. L. / Poon, C. K. et al. | 1991
- 251
-
A tight lower bound for the worst case of Bottom-Up-HeapsortFleischer, Rudolf et al. | 1991
- 263
-
Historical searching and sortingMoffat, Alistair / Petersson, Ola et al. | 1991
- 273
-
Comparison-efficient and write-optimal searching and sortingAndersson, Arne / Lai, Tony W. et al. | 1991
- 283
-
Nearest neighbors revisitedYao, Frances et al. | 1991
- 284
-
Competitiveness and response time in on-line algorithmsEstivill-Castro, Vladimir / Sherk, Murray et al. | 1991
- 294
-
A linear time optimal via assignment algorithm for Three-Dimensional channel routingHo, Jan-Ming et al. | 1991
- 308
-
Symmetry of information and one-way functionsLongpré, Luc / Mocas, Sarah et al. | 1991
- 316
-
A linear time algorithm to recognize the double euler trail for series-parallel networksHsu, Lih-Hsing / Hwang, J. Y. / Ho, T. Y. / Tsai, C. H. et al. | 1991
- 326
-
On finding a smallest augmentation to biconnect a graph (Extended abstract)Hsu, Tsan-sheng / Ramachandran, Vijaya et al. | 1991
- 336
-
A faster algorithm for edge-disjoint paths in planar graphsKaufmann, Michael / Klär, Gerhard et al. | 1991
- 349
-
An optimal construction method for generalized convex layersLenhof, Hans-Peter / Smid, Michiel et al. | 1991
- 364
-
Rectangular point location and the dynamic closest pair problemSmid, Michiel et al. | 1991
- 375
-
Parallel algorithms for some dominance problems based on a CREW PRAMChan, Ip-Wang / Friesen, Donald K. et al. | 1991
- 385
-
Parallel algorithms for finding maximal k-dependent sets and maximal f-matchingsDiks, Krzysztof / Garrido, Oscar / Lingas, Andrzej et al. | 1991