Subject: CGAL users discussion list
List archive
[cgal-discuss] exact boolean-set operations on linear polygons using ordinary integers
Chronological Thread
- From: Remi <>
- To:
- Subject: [cgal-discuss] exact boolean-set operations on linear polygons using ordinary integers
- Date: Mon, 29 Mar 2010 17:24:05 +0200
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=JIV/XKijcYE/ApgFuFzvecLYMd6NQMTHdeETxZvA8yZP6ls9l64PB2yzwnAPVrzbDQ cBIUlgSG0VL5VfnpVHJXWRFR3XqXef+EmMGyi3JzkfZiLso7KBIQhmE8sYvvnu8hMyoo xEir805vZsjtPFjbwOP8tghIR8X9i4Wt42P28=
I was wondering how feasibile it is to use the kernel:
CGAL::Homogeneous< long int >
for performing boolean-set operations on linear polygons.
Specifically: what sub-range of the range <std::numeric_limits<long
int>::min(); std::numeric_limits<long int>::max()> is available to me
for input coordinates, so as to prevent possible integer overflow
resulting from the operations on polygons with long int coordinates?
I suspect that sub-range will provide enough precision for my
application, but I'm a big math ignorant and have no idea what's going
on inside CGAL, so feel free to comment.
- [cgal-discuss] exact boolean-set operations on linear polygons using ordinary integers, Remi, 03/29/2010
Archive powered by MHonArc 2.6.16.