Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Robustness in CGAL

Subject: CGAL users discussion list

List archive

[cgal-discuss] Robustness in CGAL


Chronological Thread 
  • From: Jens Rasmussen <>
  • To:
  • Subject: [cgal-discuss] Robustness in CGAL
  • Date: Fri, 05 Sep 2008 14:47:21 +0200
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=subject:from:to:content-type:date:message-id:mime-version:x-mailer :content-transfer-encoding; b=AcpX6s61wXAWDhRGL0s0cz5gzZWCGavTo3cEEs/vXIQZZb6i1A4k0e41GR2sNcSYa1 xsLb6yF4+33dW5x1f6rnt+jGTJlC3qrfLG81Om2xX+YkLun/u4SkfpNLnT1ha6FDDfGe P2WWxVI7KKhjzcQlVMr3EuTKUsuIpoz+cEmts=

Hi

I'm a masters student at DIKU (the department of computer science -
Copenhagen University) specialized in algorithmics and library
development in C++. I have recently come to learn of CGAL in connection
with my studies in computational geometry - very impressed!

My current project is about the robustness issue in computational
geometry, with CGAL as case. I hope to learn enough about CGAL to be
able to develop an add-on to the project.

I would like to know if there exists any articles about the concrete
steps taken in CGAL to achieve robustness (both with respect to the use
of EGC together with filtering as well as dealing with degenerate cases
[do you use a perturbation scheme or do you deal with all cases?]). If
not then I suppose that the only road to enlightenment will be to read
the source files (shudder).

I have read the users manual and the developers manual, as well as the
two articles: An Adaptable and Extensible Geometry Kernel and The CGAL
Kernel:[...]. But the only thing I learned was that you ensure
robustness of high-level algorithms by ensuring robustness of the
primitive predicates and geometric constructions and that "The details
are pretty complex[...]" (quote from The CGAL Philosophy).

Any help would be appreciated!
Jens Rasmussen




Archive powered by MHonArc 2.6.16.

Top of Page