CGAL users discussion list

["Daniel Weber" <>]

Hi, 

i use the incremental builder (CGAL/Triangulation_incremental_builder_3.h) to 
reconstruct the adjacency information. This algorithm crashes during the 
reconstruction of inifite cell adjacency. Now, I want to find out why 
"Triangulation_incremental_builder_3" crashes. Maybe I should post a minimal 
code snipplet, which causes this crash. 



-------- Original-Nachricht --------
> Datum: Mon, 18 Jan 2010 13:28:30 -0500
> Von: Panagiotis Foteinos 
> <>
> An: 
> 
> Betreff: Re: [cgal-discuss] Infinite vertex in Triangulations

> CGAL triangulation datastructure (TDS) can represent any triangulation.
> 
> How do you know that the adjacency information for the infinite cells is
> not correct? Generally, there is not a unique way to triangulate
> domains; therefore, it is hard to determine the connectivity correctness
> by just visiting the cells.
> 
> Regards
> 
> Daniel Weber wrote:
> > I know that every domain can be triangulated, but i'm not sure if all of
> those triangulations can be represented by the CGAL-datastructures (using
> the infinite vertex). 
> >
> > In my specific case, i use the incremental builder to generate the
> triangulation datastructure out of a tet soup without adjacency 
> information. In
> one case, the incremental builder crashes as it is not able to reconstruct
> the adjacency information for the infinite cells. But the source of this
> (specific) data is the 3D-Mesh Generation package, where I only use cells
> from inside the complex as input. That may be a bug in the incremental
> builder, but first of all i wanted to be sure that this representation can 
> handle
> all cases. 
> >
> > Thank you for your answers.  
> >
> > -------- Original-Nachricht --------
> >   
> >> Datum: Sat, 16 Jan 2010 15:26:26 -0500
> >> Von: Panagiotis Foteinos 
> >> <>
> >> An: 
> >> 
> >> Betreff: Re: [cgal-discuss] Infinite vertex in Triangulations
> >>     
> >
> >   
> >> Are you referring to a specific family of triangulations (for example
> >> Delaunay)? If not, then every domain can be triangulated.
> >>
> >> On Sat, Jan 16, 2010 at 12:16 PM, Daniel Weber 
> >> <>
> wrote:
> >>
> >>     
> >>> Hi,
> >>>
> >>> I know that the infinite vertex in triangulations is used to
> generalize
> >>> insertions of vertices without taking care about the location of the
> new
> >>> vertex (inside / outside the domain). Are there any cases, where this
> >>>       
> >> kind
> >>     
> >>> of modelling fails, meaning that a triangulation of a domain cannot be
> >>> represented?
> >>>
> >>> I could imagine that some triangulations of concave domains cannot be
> >>> represented. Does anybody know papers discussing those issues?
> >>>
> >>> Thank you,
> >>>
> >>> Daniel
> >>> --
> >>> GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT!
> >>> Jetzt freischalten unter http://portal.gmx.net/de/go/maxdome01
> >>>
> >>> --
> >>> You are currently subscribed to cgal-discuss.
> >>> To unsubscribe or access the archives, go to
> >>> https://lists-sop.inria.fr/wws/info/cgal-discuss
> >>>
> >>>
> >>>       
> >> -- 
> >> You are currently subscribed to cgal-discuss.
> >> To unsubscribe or access the archives, go to
> >> https://lists-sop.inria.fr/wws/info/cgal-discuss
> >>
> >>     
> >
> >   
> 
> 
> -- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss

-- 
GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT!
Jetzt freischalten unter http://portal.gmx.net/de/go/maxdome01