Search results for "cgal"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Idit Haran, Dan Halperin	An experimental study of point location in planar arrangements in CGAL.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	computational geometry, generic programming, arrangements, Point location, CGAL
3	A. G. Oliveira, Pedro Jussieu de Rezende, F. P. Selmi-Dei	An extension of CGAL to the oriented projective plane T2 and its dynamic visualization system.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	oriented projective plane, visualization, algorithm animation, CGAL
2	Andreas Fabri, Sylvain Pion	CGAL: the Computational Geometry Algorithms Library.	GIS	2009	DBLP DOI BibTeX RDF	geometric data structures and algorithms, C++, open source, generic programming, exact geometric computing
2	Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler	Parallel geometric algorithms for multi-core computers.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	box intersection, compact container, d-dimension, spatial sort, parallel algorithms, multi-core, delaunay triangulations, geometric algorithms, kd-trees, cgal
2	Efi Fogel, Ophir Setter, Dan Halperin	Arrangements of geodesic arcs on the sphere.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	robustness and precision, arrangements, voronoi, cgal
2	Andreas Fabri	Voronoi Diagrams in CGAL, the Computational Geometry Algorithms Library.	ISVD	2007	DBLP DOI BibTeX RDF
2	Iddo Hanniel, Ron Wein	An exact, complete and efficient computation of arrangements of Bézier curves.	Symposium on Solid and Physical Modeling	2007	DBLP DOI BibTeX RDF	Bézier curves, robustness, arrangements, exact computation, CGAL
2	Jochen Comes, Mark Ziegelmann	An Easy to Use Implementation of Linear Perturbations within CGAL.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan	The Design and Implementation of Planar Maps in CGAL.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp	Applications of the Generic Programming Paradigm in the Design of CGAL.	Generic Programming	1998	DBLP DOI BibTeX RDF
1	Efi Fogel, Dan Halperin, Ron Wein	CGAL Arrangements and Their Applications - A Step-by-Step Guide.		2012	DOI RDF
1	Nicolas Chevallier, Yvan Maillot	Boundary of a non-uniform point cloud for reconstruction: extended abstract.	Symposium on Computational Geometry	2011	DBLP DOI BibTeX RDF
1	Menelaos I. Karavelas	Exact Geometric and Algebraic Computations in CGAL.	ICMS	2010	DBLP DOI BibTeX RDF
1	Naama Mayer, Efi Fogel, Dan Halperin	Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space.	Symposium on Solid and Physical Modeling	2010	DBLP DOI BibTeX RDF
1	Pedro Machado Manhães de Castro, Frédéric Cazals, Sébastien Loriot, Monique Teillaud	Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere.	Comput. Geom.	2009	DBLP DOI BibTeX RDF
1	Nader Salman, Mariette Yvinec	High resolution surface reconstruction from overlapping multiple-views.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	cimg, restricted delaunay triangulation, triangle soup, surface reconstruction, multiple-views, delaunay refinement, cgal
1	Pierre Alliez, Andreas Fabri	Computational geometry algorithms library.	SIGGRAPH ASIA Courses	2009	DBLP DOI BibTeX RDF
1	Ioannis Z. Emiris, Elias P. Tsigaridas, George M. Tzoumas	Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses.	Symposium on Solid and Physical Modeling	2009	DBLP DOI BibTeX RDF
1	Robert L. Constable	Building Mathematics-Based Software Systems to Advance Science and Create Knowledge.	Efficient Algorithms	2009	DBLP DOI BibTeX RDF
1	Manuel Caroli, Monique Teillaud	Computing 3D Periodic Triangulations.	ESA	2009	DBLP DOI BibTeX RDF
1	Philippe Moireau, Dominique Chapelle, Mariette Yvinec	Cardiac Motion Extraction from Images by Filtering Estimation Based on a Biomechanical Model.	FIMH	2009	DBLP DOI BibTeX RDF
1	Sylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas	Univariate Algebraic Kernel and Application to Arrangements.	SEA	2009	DBLP DOI BibTeX RDF
1	Peter Hachenberger	Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces.	Algorithmica	2009	DBLP DOI BibTeX RDF	Decomposition of polyhedra into convex pieces, Nef polyhedra, Tight passage, Exact arithmetic, Minkowski sum
1	Manuel Caroli, Nico Kruithof, Monique Teillaud	Decoupling the CGAL 3D Triangulations from the Underlying Space.	ALENEX	2008	DBLP BibTeX RDF
1	Eric Berberich, Michael Kerber	Exact arrangements on tori and Dupin cyclides.	Symposium on Solid and Physical Modeling	2008	DBLP DOI BibTeX RDF	Dupin ring cyclide, robustness, generic programming, surfaces, torus, arrangements, exact geometric computation, CGAL
1	Iddo Hanniel, Gershon Elber	Computing the Voronoi cells of planes, spheres and cylinders in R3.	Symposium on Solid and Physical Modeling	2008	DBLP DOI BibTeX RDF	skeleton, medial axis, constructive solid geometry
1	Frédéric Cazals, Marc Pouget	Algorithm 889: Jet_fitting_3: ---A Generic C++ Package for Estimating the Differential Properties on Sampled Surfaces via Polynomial Fitting.	ACM Trans. Math. Softw.	2008	DBLP DOI BibTeX RDF	C++ design, sampled surfaces, computational geometry, Approximation, interpolation, differential geometry, numerical linear algebra
1	Chee-Keng Yap	Theory of Real Computation According to EGC.	Reliable Implementation of Real Number Algorithms	2008	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Remco C. Veltkamp	A decade of CGAL.	Comput. Geom.	2007	DBLP DOI BibTeX RDF
1	Deepak Bandyopadhyay, Jack Snoeyink	Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL.	Comput. Geom.	2007	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Pooran Memari	Shape reconstruction from unorganized cross-sections.	Symposium on Geometry Processing	2007	DBLP DOI BibTeX RDF
1	Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein	Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step.	ESA	2007	DBLP DOI BibTeX RDF
1	Peter Hachenberger	Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces.	ESA	2007	DBLP DOI BibTeX RDF
1	Lakulish Antani, Christophe Delage, Pierre Alliez	Mesh Sizing with Additively Weighted Voronoi Diagrams.	IMR	2007	DBLP DOI BibTeX RDF
1	Ming-Hung Tsai, Jyh-Da Wei, Jeng-Hung Huang, D. T. Lee	A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	LEDA, camera position, line segment intersection, computational geometry, convex hull, algorithm visualization, CGAL
1	Eli Packer	Iterated snap rounding with bounded drift.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	finite precision approximation, geometric rounding, robustness, arrangements, line segments
1	Michal Meyerovitch	Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces.	ESA	2006	DBLP DOI BibTeX RDF
1	Manuel Abellanas, Alfredo de las Vegas	DEpthLAUNAY.	ICMS	2006	DBLP DOI BibTeX RDF
1	Efi Fogel, Dan Halperin	Exact Minkowski sums of convex polyhedra.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Ron Wein, Jur P. van den Berg, Dan Halperin	The Visibility-Voronoi Complex and Its Applications.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	path optimization, voronoi diagrams, motion planning, visibility graphs
1	Peter Hachenberger, Lutz Kettner	Boolean operations on 3D selective Nef complexes: optimized implementation and experiments.	Symposium on Solid and Physical Modeling	2005	DBLP DOI BibTeX RDF	boundary evaluation, exactness, nef polyhedra, unbounded polyhedra, algorithms, data structures, benchmark, robustness, experiments, completeness, CSG, non-manifold, B-rep
1	Jean-Daniel Boissonnat, Christophe Delage	Convex Hull and Voronoi Diagram of Additively Weighted Points.	ESA	2005	DBLP DOI BibTeX RDF
1	Friso Penninga, Edward Verbree, Wilko Quak, Peter van Oosterom	Construction of the Planar Partition Postal Code Map Based on Cadastral Registration.	GeoInformatica	2005	DBLP DOI BibTeX RDF	reverse geocoding, postal code map, algorithms, applications, aggregation, skeletonization
1	Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, Elias P. Tsigaridas	Towards and open curved kernel.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	conic arc, C++, arrangement, exact geometric computation
1	Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin	Continuous path verification in multi-axis NC-machining.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	path verification, lower envelopes, NC-machining
1	Efi Fogel, Ron Wein, Dan Halperin	Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements.	ESA	2004	DBLP DOI BibTeX RDF
1	Kaspar Fischer, Bernd Gärtner	The smallest enclosing ball of balls: combinatorial structure and algorithms.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	distance to convex hull, minimal covering ball, minimum volume sphere, unique sink orientation
1	Friso Penninga, Edward Verbree, Wilko Quak, Peter van Oosterom	Construction of the planar partition postal code map based on cadastral reGIStration.	GIS	2003	DBLP DOI BibTeX RDF	GIS, skeletonization, triangulation
1	Olivier Devillers, Monique Teillaud	Perturbations and vertex removal in a 3D delaunay triangulation.	SODA	2003	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, Mariette Yvinec	Triangulations in CGAL.	Comput. Geom.	2002	DBLP DOI BibTeX RDF
1	Eti Ezra, Dan Halperin, Micha Sharir	Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice.	ESA	2002	DBLP DOI BibTeX RDF
1	Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust	Computing a canonical polygonal schema of an orientable triangulated surface.	Symposium on Computational Geometry	2001	DBLP DOI BibTeX RDF
1	Matthias Bäsken, Stefan Näher	GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms.	Software Visualization	2001	DBLP DOI BibTeX RDF
1	Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel	An Adaptable and Extensible Geometry Kernel.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF	library design, Computational geometry, generic programming
1	Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr	On the design of CGAL a computational geometry algorithms library.	Softw., Pract. Exper.	2000	DBLP DOI BibTeX RDF
1	Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra	The Design and Implementation of Planar Maps in CGAL.	ACM Journal of Experimental Algorithmics	2000	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, Mariette Yvinec	Triangulations in CGAL (extended abstract).	Symposium on Computational Geometry	2000	DBLP DOI BibTeX RDF
1	Iddo Hanniel, Dan Halperin	Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
1	Jean-Daniel Boissonnat, Frédéric Cazals, Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, Mariette Yvinec	Programming with CGAL: The Example of Triangulations.	Symposium on Computational Geometry	1999	DBLP DOI BibTeX RDF	C++
1	Stefan Schirra	A Case Study on the Cost of Geometric Computing.	ALENEX	1999	DBLP DOI BibTeX RDF
1	Kurt Mehlhorn	The Engineering of Some Bipartite Matching Programs.	ISAAC	1999	DBLP DOI BibTeX RDF
1	Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr	The CGAL Kernel: A Basis for Geometric Computation.	WACG	1996	DBLP DOI BibTeX RDF
1	Mark H. Overmars	Designing the Computational Geometry Algorithms Library CGAL.	WACG	1996	DBLP DOI BibTeX RDF