[vtkusers] concave polygons
sagi schein
schein at cs.Technion.AC.IL
Mon Jun 24 02:40:37 EDT 2002
AFAIK Open gl does not guarantee that concave polygons would be rendered
correctly, the question is does vtk has a class/filter that would take a
polygonal data and split the concave polygons into a set of convex one -
and do it efficiently that is without doing excessive split.
The same for the second Q - does vtk has the facilities to detect a
concave polygon so I don't have to reinvent it.
-----Original Message-----
From: Andrew J. P. Maclean [mailto:a.maclean at acfr.usyd.edu.au]
Sent: Monday, June 24, 2002 1:29 AM
To: 'sagi schein'
Subject: RE: [vtkusers] concave polygons
If I understand the questions:
1: No - they are geometrically distinct.
2: Look at the curvatures - a differential geometry book should give you
some examples of how to do this.
___________________________________________
Andrew J. P. Maclean
Postal:
Australian Centre for Field Robotics
The Rose Street Building J04
The University of Sydney 2006 NSW
AUSTRALIA
Room: 106
Phone: +61 2 9351 3283
Fax: +61 2 9351 7474
http://www.acfr.usyd.edu.au/
___________________________________________
-----Original Message-----
From: vtkusers-admin at public.kitware.com
[mailto:vtkusers-admin at public.kitware.com] On Behalf Of sagi schein
Sent: Saturday, 22 June 2002 16:02
To: vtkusers at public.kitware.com
Subject: [vtkusers] concave polygons
Is there any to
1. Generate convex polygon(s) out of a concave polygon using vtk?
2. Identify concave polygons?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20020624/e2036392/attachment.htm>
More information about the vtkusers
mailing list