On intersecting a set of parallel line segments with a convex polygon of minimum area

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 105; H. 2; S. 58 - 64
Hauptverfasser: Mukhopadhyay, Asish, Kumar, Chanchal, Greene, Eugene, Bhattacharya, Binay
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 2008
Elsevier Science
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computational geometry
Computer science; control theory; systems
Exact sciences and technology
Geometric intersection
Geometric optimization
Geometry
Mathematics
Miscellaneous
Numerical analysis
Numerical analysis. Scientific computation
Numerical approximation
Sciences and techniques of general use
Theoretical computing
Computational geometry
Algorithms
Geometric optimization
Geometric intersection
Intersection
Computer theory
Line segment
Optimization method
Algorithm
Optimization
Area
Information processing
Convex polygon
Algorithm analysis
ISSN:0020-0190, 1872-6119
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2007.08.029