EXACUS: Efficient and exact algorithms for curves and surfaces

30Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present the first release of the EXACUS C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Berberich, E., Eigenwillig, A., Hemmer, M., Hert, S., Kettner, L., Mehlhorn, K., … Wolpert, N. (2005). EXACUS: Efficient and exact algorithms for curves and surfaces. In Lecture Notes in Computer Science (Vol. 3669, pp. 155–166). Springer Verlag. https://doi.org/10.1007/11561071_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free