Preview
Unable to display preview. Download preview PDF.
References
J.L. Bentley and Th. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers, 28:643–647, 1979.
J.L. Bentley and D. Wood. An optimal worst-case algorithm for reporting intersections of rectangles. IEEE Transactions on Computers, C-29:571–577, 1980.
M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448–461, 1973.
B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM, 39:1–54, 1992.
R.W. Floyd and R.L. Rivest. Expected time bounds for selection. Communications of the ACM, 18:165–172, 1975.
ISO 8879: Information processing-Text and office systems-Standard Generalized Markup Language (SGML), October 1986. International Organization for Standardization.
P. Kilpeläinen and D. Wood. SGML and exceptions. In C. Nicholas and D. Wood, editors, Proceedings of the Third International Workshop on Principles of Document Processing (PODP 96), pages 39–49, Heidelberg, 1997. Springer-Verlag. Lecture Notes in Computer Science 1293.
T. K. S. Leslie. Efficient approaches to subset construction. Technical Report CS-92-29, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1992. MMath Thesis.
E.W. Myers. An O(E log E + I) expected time algorithm for the planar segment intersection problem. SIAM Journal on Computing, 14:625–637, 1985.
M.I. Shamos and D. Hoey. Geometric intersection problems. In Proceedings of the Seventeenth IEEE Symposium on Foundations of Computer Science, pages 208–215, Piscataway, NJ, 1976. IEEE, Inc.
G. van Noord. Treatment of e-moves in subset construction. Unpublished manuscript, Groningen, Netherlands, 1998.
L. van Zijl. Generalized Nondeterminism and the Succinct Representation of Regular Languages. PhD thesis, Department of Computer Science, The University of Stellenbosch, Stellenbosch, South Africa, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wood, D. (1998). WIA and theory and practice. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031376
Download citation
DOI: https://doi.org/10.1007/BFb0031376
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive