Fast Triangulation of Simple Polygons

Hertel, Stefan; Mehlhorn, Kurt; Karpinski, Marek

Local TagsRelease HistoryDetailsSummary

Fast Triangulation of Simple Polygons

Hertel, S., & Mehlhorn, K. (1983). Fast Triangulation of Simple Polygons. In Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983) (pp. 207-218). Berlin, Germany: Springer.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AF34-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-4040-4

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Hertel, Stefan¹, Author
Mehlhorn, Kurt², Author
Karpinski, Marek¹, Editor

Affiliations:
1Max Planck Society, ou_persistent13
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1983

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344637
Other: Local-ID: C1256428004B93B8-5BC162B5C728E373C12571C2005E288D-mehlhorn83fz

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Borgholm, Sweden

Start-/End Date: 1983-08-21

Legal Case

show

Project information

show

Source 1

show

hide

Title: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Berlin, Germany : Springer

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 207 - 218 Identifier: ISBN: 3-540-12689-9

Source 2

show

hide

Title: Lecture Notes in Computer Science

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -