Author:
Bieri Hanspeter,Schmidt Peter-Michael
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers C-28, 643–647 (1979).
2. Beretta, G., Meier, A.: Scan Converting Polygons Based on Plane-Sweep. Technical Report 68, Institut für Informatik, ETHZ (1986).
3. Bieri, H., Nef, W.: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form. Linear Algebra Appl. 52/53, 69–97 (1983).
4. Bieri, H., Nef, W.: A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form. Computing 34, 287–302 (1985).
5. Edelsbrunner, H., Mücke, E.P.: Simulation of Simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9, 66–104 (1990).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献