The medial axis of a simple polygon (Englisch)
Nationallizenz
- Neue Suche nach: Preparata, F. P.
- Neue Suche nach: Preparata, F. P.
In:
Mathematical Foundations of Computer Science 1977
;
443-450
;
1977
-
ISBN:
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:The medial axis of a simple polygon
-
Beteiligte:Preparata, F. P. ( Autor:in )
-
Erschienen in:Lecture Notes in Computer Science ; 53 ; 443-450
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:01.01.1977
-
Format / Umfang:8 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
On the structure and properties of NP-complete problems and their associated optimization problemsAusiello, Giorgio et al. | 1977
- 17
-
A comparative review of some program verification methodsBlikle, Andrzej et al. | 1977
- 34
-
Classification of the context-free languagesBoasson, L. et al. | 1977
- 44
-
Finite automaton from a flowchart scheme point of viewElgot, Calvin C. et al. | 1977
- 52
-
A new type of models of computationEngeler, E. et al. | 1977
- 59
-
Correctness of mixed computation in ALGOL-like programsErshov, A. P. / Itkin, V. E. et al. | 1977
- 78
-
Algebra and logic in theoretical computer scienceGécseg, Ferenc / Péter, E.-Tóth et al. | 1977
- 93
-
A survey of recent problems and results in analytic computational complexityKacewicz, B. / Woźniakowski, H. et al. | 1977
- 108
-
Tree-structures for set manipulation problemsMaurer, H. A. / Ottmann, Th. et al. | 1977
- 122
-
Applied algorithmic logicSalwicki, Andrzej et al. | 1977
- 135
-
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomialsSchnorr, C. P. et al. | 1977
- 148
-
Frequency algorithms and computationsTrakhtenbrot, B. A. et al. | 1977
- 162
-
Graph-theoretic arguments in low-level complexityValiant, Leslie G. et al. | 1977
- 177
-
Properties of complexity classes a short surveyWechsung, Gerd et al. | 1977
- 192
-
A uniform approach to inductive posets and inductive closureWright, J. B. / Wagner, E. G. / Thatcher, J. W. et al. | 1977
- 213
-
Generalized probabilistic grammarsAgafonov, V. N. et al. | 1977
- 222
-
Classes of structurally isomorphic np-optimization problemsAusiello, Giorgio / D'Atri, Alessandro / Gaudiano, Marco / Protasi, Marco et al. | 1977
- 231
-
Pushdown-automata and families of languages generating cylindersAutebert, Jean-Michel et al. | 1977
- 240
-
Semantics of infinite processes using generalized treesBakker, J. W. et al. | 1977
- 247
-
Characterization of recognizable families by means of regular languagesBenda, Václav / Bendová, Kamila et al. | 1977
- 253
-
An algebraic approach to problem solution and problem semanticsBertoni, A. / Mauri, G. / Torelli, M. et al. | 1977
- 263
-
Complexity and minimality of context-free grammars and languagesČerný, A. et al. | 1977
- 272
-
Comparison of the active visiting and the crossing complexitiesChytil, Michal P. et al. | 1977
- 282
-
Arithmetical complexity of some problems in computer scienceHájek, P. et al. | 1977
- 288
-
Formal transformations and the development of programsHenke, Friedrich W. et al. | 1977
- 297
-
Optimal rasp programs for arbitrarily complex 0–1 valued functionsHorváth, Sándor et al. | 1977
- 303
-
The expressive power of intensional logic in the semantics of programming languagesJanssen, T. M. V. / Emde Boas, P. et al. | 1977
- 312
-
On the complexity of equivalent transformations in programming languagesKanovič, Max I. et al. | 1977
- 315
-
Schematology in a MJ I/T I-language OPT imizerKasyanov, V. N. / Pokrovsky, S. B. et al. | 1977
- 324
-
Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructionsKorec, Ivan et al. | 1977
- 333
-
A top-down no backtrack parsing of general context-free languagesKrál, Jaroslav et al. | 1977
- 342
-
A probabilistic restriction of branching plansKramosil, Ivan et al. | 1977
- 350
-
Reducing operators for normed general formal systemsKudlek, Manfred / Novotný, Miroslav et al. | 1977
- 359
-
Invariant properties of informational bulksLevin, L. A. / jugin, V. V. V et al. | 1977
- 365
-
Two decidability results for deterministic pushdown automataLinna, Matti et al. | 1977
- 374
-
On the logic of incomplete informationLipski, Witold Jr. et al. | 1977
- 382
-
Measures of ambiguity in the analysis of complex systemsLuca, Aldo / Termini, Settimo et al. | 1977
- 390
-
Two-level meta-controlled substitution grammarsMeersman, R. / Rozenberg, G. et al. | 1977
- 398
-
A calculus to build up correct programsMiglioli, P. A. / Ornaghi, M. et al. | 1977
- 410
-
Another approach for proving program correctnessNg, Peter A. / Bang, Sung Y. et al. | 1977
- 420
-
Cover results and normal formsNijholt, Anton et al. | 1977
- 430
-
On a deterministic subclass of context-free languagesPeckel, Jan et al. | 1977
- 435
-
Exponential optimization for the LLP(k) parsing methodPittl, Jan et al. | 1977
- 443
-
The medial axis of a simple polygonPreparata, F. P. et al. | 1977
- 451
-
Semantics and proof rules for coroutine hierarchies in block-structured programming languagesRaulefs, Peter et al. | 1977
- 460
-
Acceptors for iteration languagesRozenberg, G. / Vermeir, D. et al. | 1977
- 465
-
How good is the adversary lower bound ?Ružička, Peter / Wiedermann, Juraj et al. | 1977
- 475
-
Total correctness for proceduresSokołowski, Stefan et al. | 1977
- 484
-
A model for retrieval systems and some mathematical problems behindSturc, Ján et al. | 1977
- 493
-
Time and tape bounded auxiliary pushdown automataSudborough, I. H. et al. | 1977
- 504
-
A fast non-commutative algorithm for matrix multiplicationSýkora, Ondrej et al. | 1977
- 513
-
Fixed-points and algebras with infinitely long expressions, ITiuryn, J. et al. | 1977
- 523
-
On languages, accepted by machines in the category of setsTrnková, Věra / Adámek, Jiří et al. | 1977
- 532
-
Real time computations with restrictions on tape alphabetValiev, M. K. et al. | 1977
- 537
-
The bodnarchuk metric space of languages and the topology of the learning spaceVianu, Victor et al. | 1977
- 543
-
Complexity hierarchies of oraclesWagner, Klaus / Wechsung, Gerd et al. | 1977
- 549
-
Determining processes by violationsWedde, Horst / Winkowski, Józef et al. | 1977
- 560
-
The influence of the machine model on the time complexity of context-free language recognitionWeicker, Reinhold et al. | 1977
- 570
-
A generalized computability thesisWeihrauch, Klaus et al. | 1977
- 571
-
Identification of formal languagesWiehagen, Rolf et al. | 1977
- 580
-
Correctness of recursive flow diagram programsGoguen, J. A. / Meseguer, J. et al. | 1977