O(lg N) Line Clipping Algorithm in E2

dc.contributor.authorSkala, Václav
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-03-27T08:54:48Z
dc.date.available2015-03-27T08:54:48Z
dc.date.issued1994
dc.description.abstractA new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.en
dc.format18 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationWinter School of Computer Graphics and CAD Systems 94: University of West Bohemia: Pilsen, Czech Republic, January 19-20, 1994, p. 174-191.en
dc.identifier.isbn80-7082-192-2
dc.identifier.urihttp://wscg.zcu.cz/wscg1994/papers94/Skala_94.pdf
dc.identifier.urihttp://hdl.handle.net/11025/15403
dc.language.isoenen
dc.publisherZápadočeská univerzitacs
dc.relation.ispartofseriesWinter School of Computer Graphics and CAD Systems 94en
dc.rights© Západočeská univerzita v Plznics
dc.rights.accessopenAccessen
dc.subjectořezávání přímkycs
dc.subjectkonvexní polygoncs
dc.subjectpočítačová grafikacs
dc.subjectsložitost algoritmůcs
dc.subject.translatedline clippingen
dc.subject.translatedconvex polygonen
dc.subject.translatedcomputer graphicsen
dc.subject.translatedalgorithm complexityen
dc.titleO(lg N) Line Clipping Algorithm in E2en
dc.typečlánekcs
dc.typekonferenční příspěvekcs
dc.typearticleen
dc.typeconferenceObjecten
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
Skala_94.pdf
Size:
1.21 MB
Format:
Adobe Portable Document Format
Description:
Plný text
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: