Search results for "polyhedral surfaces"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack	Determining approximate shortest paths on weighted polyhedral surfaces.	J. ACM	2005	DBLP DOI BibTeX RDF	weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces
3	Estarose Wolfson, Eric L. Schwartz	Computing Minimal Distances on Polyhedral Surfaces.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	3D polyhedral surfaces, minimal distances, biological surfaces, biological techniques and instruments, pattern recognition, computational geometry, computational geometry, picture processing, shortest path, computerised picture processing, computerised pattern recognition, biology computing, surface geometry, distance geometry, flattening
2	Mukund Balasubramanian, Jonathan R. Polimeni, Eric L. Schwartz	Exact Geodesics and Shortest Paths on Polyhedral Surfaces.	IEEE Trans. Pattern Anal. Mach. Intell.	2009	DBLP DOI BibTeX RDF
2	Alexander I. Bobenko	Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	Lapace operator, dirichlet energy, flipping algorithm, Delaunay triangulation, discrete differential geometry
2	Rémi Synave, Stefka Gueorguieva, Pascal Desbarats	Constraint Shortest Path Computation on Polyhedral Surfaces.	ICVGIP	2008	DBLP DOI BibTeX RDF
2	Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack	Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.	MFCS	2006	DBLP DOI BibTeX RDF
2	Dominique Attali, Jean-Daniel Boissonnat	Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.	Discrete & Computational Geometry	2003	DBLP DOI BibTeX RDF
2	Lyuba Alboul	Optimising Triangulated Polyhedral Surfaces with Self-intersections.	IMA Conference on the Mathematics of Surfaces	2003	DBLP DOI BibTeX RDF
2	Dominique Attali, Jean-Daniel Boissonnat	A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces.	Symposium on Solid Modeling and Applications	2002	DBLP DOI BibTeX RDF	complexity, sample, Voronoi diagram, reconstruction, Delaunay triangulation, surface modeling, polyhedral surfaces
2	Gabriel Taubin	Curve and Surface Smoothing without Shrinkage. (PDF / PS)	ICCV	1995	DBLP DOI BibTeX RDF	piecewise-linear techniques, curve smoothing, scientific data visualization, multimodal medical data registration, polygonal curves, boundary-following algorithms, iso-surface construction algorithms, piecewise linear shapes, linear low-pass filter, high curvature variations, required storage, computer vision, computational complexity, computational complexity, approximation algorithms, computational geometry, topology, image registration, medical image processing, data visualisation, curve fitting, edges, faces, vertices, smoothing methods, faceting, shrinkage, polyhedral surfaces, surface smoothing
2	Eric L. Schwartz, Alan Shaw, Estarose Wolfson	A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	brain surface, mapmaker's problem, flattening nonconvex polyhedral surfaces, functional architectures, neural maps, neuroanatomy, goodness of fit distances, complex folded surface, computational geometry, picture processing, computerised picture processing, visual cortex, neurophysiology, curved surfaces
1	Klaus Hildebrandt, Konrad Polthier	Generalized shape operators on polyhedral surfaces.	Computer Aided Geometric Design	2011	DBLP DOI BibTeX RDF
1	Hristo Djidjev, Christian Sommer	Approximate Distance Queries for Weighted Polyhedral Surfaces.	ESA	2011	DBLP DOI BibTeX RDF
1	Gutemberg Guerra Filho, Pedro J. de Rezende	Characterization of Shortest Paths on Directional Frictional Polyhedral Surfaces.	CCCG	2011	DBLP BibTeX RDF
1	Alexei Bespalov, Norbert Heuer, Ralf Hiptmair	Convergence of the Natural hp-BEM for the Electric Field Integral Equation on Polyhedral Surfaces.	SIAM J. Numerical Analysis	2010	DBLP DOI BibTeX RDF
1	Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack	Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.	Discrete & Computational Geometry	2010	DBLP DOI BibTeX RDF
1	Tomohiro Tachi	Origamizing Polyhedral Surfaces.	IEEE Trans. Vis. Comput. Graph.	2010	DBLP DOI BibTeX RDF	origami design, computer-aided design, folding, developable surface, Origami
1	Shubhangi Saraf	Acute and nonobtuse triangulations of polyhedral surfaces.	Eur. J. Comb.	2009	DBLP DOI BibTeX RDF
1	Alexander I. Bobenko, Christian Mercat, Markus Schmies	Conformal Structures and Period Matrices of Polyhedral Surfaces	CoRR	2009	DBLP BibTeX RDF
1	Sanjiv Kapoor, Xiang-Yang Li	Geodesic Spanners on Polyhedral Surfaces.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Pierre Alliez, Andreas Fabri	Computational geometry algorithms library.	SIGGRAPH ASIA Courses	2009	DBLP DOI BibTeX RDF
1	Mohammed Mostefa Mesmoudi, Leila De Floriani, Paola Magillo	Morphological analysis of terrains based on discrete curvature and distortion.	GIS	2008	DBLP DOI BibTeX RDF	morphology, curvature, terrain modeling
1	Rong Liu, Hao Zhang 0002, James Busby	Convex hull covering of polygonal scenes for accurate collision detection in games.	Graphics Interface	2008	DBLP DOI BibTeX RDF
1	Christian Mercat	Discrete Complex Structure on Surfel Surfaces.	DGCI	2008	DBLP DOI BibTeX RDF
1	Shi-Qing Xin, Guo-Jin Wang	Efficiently determining a locally exact shortest path on polyhedral surfaces.	Computer-Aided Design	2007	DBLP DOI BibTeX RDF
1	Marta Fort, Joan Antoni Sellarès	Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces.	ISVD	2007	DBLP DOI BibTeX RDF
1	David Lesage, Jean-Claude Léon, Philippe Véron	Discrete Curvature Approximations and Segmentation of Polyhedral Surfaces.	International Journal of Shape Modeling	2005	DBLP DOI BibTeX RDF
1	Lyuba Alboul, Gilberto Echeverria, Marcos A. Rodrigues	Discrete curvatures and Gauss maps for polyhedral surfaces.	EuroCG	2005	DBLP BibTeX RDF
1	Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt	Controlled perturbation for Delaunay triangulations.	SODA	2005	DBLP DOI BibTeX RDF	controlled perturbation, oating point computation, randomized incremental construction, delaunay triangulations, convex hulls, randomized incremental algorithm
1	Lyuba Alboul, Gilberto Echeverria	Polyhedral Gauss Maps and Curvature Characterisation of Triangle Meshes.	IMA Conference on the Mathematics of Surfaces	2005	DBLP DOI BibTeX RDF
1	Dominique Attali, Jean-Daniel Boissonnat	A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li	Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces.	Comput. Geom.	2003	DBLP DOI BibTeX RDF
1	Franck Hétroy, Dominique Attali	Detection of constrictions on closed polyhedral surfaces.	VisSym	2003	DBLP BibTeX RDF
1	David Cohen-Steiner, Jean-Marie Morvan	Restricted delaunay triangulations and normal cycle.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	geometric measure theory, mesh, curvature
1	Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack	An Improved Approximation Algorithm for Computing Geometric Shortest Paths.	FCT	2003	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Lyuba Alboul, Ferran Hurtado	On Flips in Polyhedral Surfaces.	Int. J. Found. Comput. Sci.	2002	DBLP BibTeX RDF
1	Shymon Shlafman, Ayellet Tal, Sagi Katz	Metamorphosis of Polyhedral Surfaces using Decomposition.	Comput. Graph. Forum	2002	DBLP DOI BibTeX RDF
1	Hayim Shaul, Dan Halperin	Improved construction of vertical decompositions of three-dimensional arrangements.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	geometric software, vertical decomposition, arrangements, exact computation
1	Pierre-Marie Gandoin, Olivier Devillers	Progressive lossless compression of arbitrary simplicial complexes.	SIGGRAPH	2002	DBLP DOI BibTeX RDF	non manifold meshes, interactivity, coding, progressivity, mesh compression
1	Pierre-Marie Gandoin, Olivier Devillers	Progressive lossless compression of arbitrary simplicial complexes.	ACM Trans. Graph.	2002	DBLP DOI BibTeX RDF	non manifold meshes, interactivity, coding, progressivity, mesh compression
1	Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	Approximating Shortest Paths on Weighted Polyhedral Surfaces.	Algorithmica	2001	DBLP DOI BibTeX RDF
1	Hervé Brönnimann	Designing and Implementing a General Purpose Halfedge Data Structure.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
1	Gill Barequet, Daniel Shapiro, Ayellet Tal	Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices.	The Visual Computer	2000	DBLP DOI BibTeX RDF	Interpolation, Surface reconstruction, Triangulation
1	Jen-Hui Chuang, Chi-Hao Tsai, Min-Chi Ko	Skeletonization of Three-Dimensional Object Using Generalized Potential Field.	IEEE Trans. Pattern Anal. Mach. Intell.	2000	DBLP DOI BibTeX RDF	3D skeletonization, 3D thinning, distance function, medial axis transform, potential field
1	Lutz Kettner	Using generic programming for designing a data structure for polyhedral surfaces.	Comput. Geom.	1999	DBLP DOI BibTeX RDF
1	Sigal Raab	Controlled Perturbation for Arrangements of Polyhedral Surfaces with Application to Swept Volumes.	Symposium on Computational Geometry	1999	DBLP DOI BibTeX RDF
1	Konrad Polthier, Markus Schmies, Martin Steffens, Christian Teitzel	The Video "Geodesics and Waves".	Symposium on Computational Geometry	1999	DBLP DOI BibTeX RDF	geodesic flow, isometric texture maps, geodesics, polyhedral surfaces
1	Lutz Kettner	Designing a Data Structure for polyhedral Surfaces.	Symposium on Computational Geometry	1998	DBLP DOI BibTeX RDF	C++
1	Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.	SWAT	1998	DBLP DOI BibTeX RDF
1	Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	Approximating Weighted Shortest Paths on Polyhedral Surfaces.	Symposium on Computational Geometry	1997	DBLP DOI BibTeX RDF
1	Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	Approximating Weighted Shortest Paths on Polyhedral Surfaces.	Symposium on Computational Geometry	1997	DBLP DOI BibTeX RDF
1	Gabriel Taubin, Tong Zhang, Gene H. Golub	Optimal Surface Smoothing as Filter Design.	ECCV	1996	DBLP DOI BibTeX RDF
1	R. Hughes-Jones	Enumerating uniform polyhedral surfaces with triangular faces.	Discrete Mathematics	1995	DBLP DOI BibTeX RDF
1	Brett T. Garrett	Circle Packing and Polyhedral Surfaces.	Discrete & Computational Geometry	1992	DBLP DOI BibTeX RDF
1	Joseph S. B. Mitchell, Subhash Suri	Separation and Approximation of Polyhedral Objects.	SODA	1992	DBLP DOI BibTeX RDF
1	John H. Reif, Sandeep Sen	An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization.	Symposium on Computational Geometry	1988	DBLP DOI BibTeX RDF
1	David M. Mount	Storing the Subdivision of a Polyhedral Surface.	Symposium on Computational Geometry	1986	DBLP DOI BibTeX RDF
1	Joseph O'Rourke, Subhash Suri, Heather Booth	Shortest Paths on Polyhedral Surfaces.	STACS	1985	DBLP DOI BibTeX RDF