Search results for "Longest-edge"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
86	Peng-Jun Wan, Chih-Wei Yi	On the Longest Edge of Gabriel Graphs in Wireless Ad Hoc Networks.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	asymptotic probability distribution, the longest edge, Wireless ad hoc network, topology control, poisson point process, Gabriel graph
69	Kenneth Weiss 0001, Leila De Floriani	Supercubes: A High-Level Primitive for Diamond Hierarchies.	IEEE Trans. Vis. Comput. Graph.	2009	DBLP DOI BibTeX RDF
48	Maria-Cecilia Rivara, Carlo Calderon, Andriy Fedorov, Nikos Chrisochoides	Parallel decoupled terminal-edge bisection method for 3D mesh generation.	Eng. Comput.	2006	DBLP DOI BibTeX RDF	Parallel mesh generation, 3-dimensional (3D), Longest-edge, Terminal-edge, Lepp
35	Kenneth Weiss 0001, Leila De Floriani	Sparse terrain pyramids.	GIS	2008	DBLP DOI BibTeX RDF	diamond hierarchies, longest edge bisection, multiresolution terrain models, nested triangle meshes
32	Maria-Cecilia Rivara	A Study on Delaunay Terminal Edge Method.	IMR	2006	DBLP DOI BibTeX RDF
25	Naoki Katoh, Takeshi Tokuyama	Notes on computing peaks in k-levels and parametric spanning trees.	SCG	2001	DBLP DOI BibTeX RDF
24	Kenneth Weiss 0001, Leila De Floriani	Isodiamond Hierarchies: An Efficient Multiresolution Representation for Isosurfaces and Interval Volumes.	IEEE Trans. Vis. Comput. Graph.	2010	DBLP DOI BibTeX RDF	longest edge bisection, diamond hierarchies, Isosurfaces, multiresolution models, interval volumes
22	Francisco Javier Ovalle-Martínez, Ivan Stojmenovic, Fabián García Nocetti, Julio Solano-González	Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks.	WEA	2004	DBLP DOI BibTeX RDF
21	Maria-Cecilia Rivara, Carlo Calderon	Lepp Terminal Centroid Method for Quality Triangulation: A Study on a New Algorithm.	GMP	2008	DBLP DOI BibTeX RDF	Lepp Delaunay algorithms, Lepp centroid, triangulations, mesh generation
21	R. Bruce Simpson, Maria-Cecilia Rivara	Geometrical Mesh Improvement Properties of Delaunay Terminal Edge Refinement.	GMP	2006	DBLP DOI BibTeX RDF
19	Jeff Erickson 0001	Local polyhedra and geometric graphs.	SCG	2003	DBLP DOI BibTeX RDF	realistic input models, collision detection, bounding volume hierarchies, binary space partition
18	Agustín Trujillo-Pino, José Pablo Suárez, Miguel A. Padrón	Finite number of similarity classes in Longest Edge Bisection of nearly equilateral tetrahedra.	Appl. Math. Comput.	2024	DBLP DOI BibTeX RDF
18	Francisco Perdomo, Ángel Plaza	Similarity Classes of the Longest-Edge Trisection of Triangles.	Axioms	2023	DBLP DOI BibTeX RDF
18	Krzysztof Podsiadlo, Albert Oliver Serra, Anna Paszynska, Rafael Montenegro, Ian Henriksen, Maciej Paszynski, Keshav Pingali	Parallel graph-grammar-based algorithm for the longest-edge refinement of triangular meshes and the pollution simulations in Lesser Poland area.	Eng. Comput.	2021	DBLP DOI BibTeX RDF
18	Sergey Korotov, Lars Fredrik Lund, Jon Eivind Vatne	Improved Maximum Angle Estimate for Longest-Edge Bisection.	Int. J. Comput. Geom. Appl.	2021	DBLP DOI BibTeX RDF
18	Albert Mosialek, Andrzej Szaflarski, Rafal Pych, Marek Kisiel-Dorohinicki, Maciej Paszynski, Anna Paszynska	Graph-Grammar Based Longest-Edge Refinement Algorithm for Three-Dimensional Optimally p Refined Meshes with Tetrahedral Elements.	ICCS (4)	2021	DBLP DOI BibTeX RDF
18	Jonathan Dupuy	Concurrent Binary Trees (with application to longest edge bisection).	Proc. ACM Comput. Graph. Interact. Tech.	2020	DBLP DOI BibTeX RDF
18	Oliver-Amadeo Vilca Huayta, María Cecilia Rivara	Study on the Average Size of the Longest-Edge Propagation Path for Triangulations.	VISIGRAPP (1: GRAPP)	2020	DBLP DOI BibTeX RDF
18	Sergey Korotov, Ángel Plaza, José P. Suárez	Longest-edge n-section algorithms: Properties and open problems.	J. Comput. Appl. Math.	2016	DBLP DOI BibTeX RDF
18	Sergey Korotov, Ángel Plaza, José P. Suárez	On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n.	Comput. Aided Geom. Des.	2015	DBLP DOI BibTeX RDF
18	Francisco Perdomo, Ángel Plaza	Corrigendum to "A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes" [Applied Mathematics and Computation 219 (4) (2012) 2342-2344].	Appl. Math. Comput.	2015	DBLP DOI BibTeX RDF
18	Bilal Hatipoglu, Can C. Özturan	Parallel Triangular Mesh Refinement by Longest Edge Bisection.	SIAM J. Sci. Comput.	2015	DBLP DOI BibTeX RDF
18	Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro	Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions.	Comput. Geom.	2015	DBLP DOI BibTeX RDF
18	Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Boglárka G.-Tóth, Inmaculada García	On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex.	Informatica	2015	DBLP BibTeX RDF
18	Juan F. R. Herrera, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García	Heuristics for Longest Edge Selection in Simplicial Branch and Bound.	ICCSA (2)	2015	DBLP DOI BibTeX RDF
18	Carlos Bedregal 0001, Maria-Cecilia Rivara	Longest-edge algorithms for size-optimal refinement of triangulations.	Comput. Aided Des.	2014	DBLP DOI BibTeX RDF
18	Antti Hannukainen, Sergey Korotov, Michal Krízek	On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions.	Sci. Comput. Program.	2014	DBLP DOI BibTeX RDF
18	Guillermo Aparicio, Leocadio G. Casado, Boglárka G.-Tóth, Eligius M. T. Hendrix, Inmaculada García	Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex.	ICCSA (2)	2014	DBLP DOI BibTeX RDF
18	Juan F. R. Herrera, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García	On Simplicial Longest Edge Bisection in Lipschitz Global Optimization.	ICCSA (2)	2014	DBLP DOI BibTeX RDF
18	Francisco Perdomo, Ángel Plaza	Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric.	Appl. Math. Comput.	2013	DBLP DOI BibTeX RDF
18	José P. Suárez, Tania Moreno, Ángel Plaza, Pilar Abad	Two-sided estimation of diameters reduction rate for the longest edge n-section of triangles with 4 n.	Appl. Math. Comput.	2013	DBLP DOI BibTeX RDF
18	Hans Achatz, Peter Kleinschmidt	Computing an Upper Bound for the Longest Edge in an Optimal TSP-Solution.	OR	2013	DBLP DOI BibTeX RDF
18	Angel Plaza, Sergio Falcón, José P. Suárez, Pilar Abad	A local refinement algorithm for the longest-edge trisection of triangle meshes.	Math. Comput. Simul.	2012	DBLP DOI BibTeX RDF
18	Francisco Perdomo, Ángel Plaza	A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes.	Appl. Math. Comput.	2012	DBLP DOI BibTeX RDF
18	José P. Suárez, Tania Moreno, Pilar Abad, Angel Plaza	Properties of the longest-edge n-section refinement scheme for triangular meshes.	Appl. Math. Lett.	2012	DBLP DOI BibTeX RDF
18	Carlos Bedregal 0001, María Cecilia Rivara	A Study on Size-Optimal Longest Edge Refinement Algorithms.	IMR	2012	DBLP DOI BibTeX RDF
18	Stefan Ohrhallinger, Sudhir P. Mudur	Minimising Longest Edge for Closed Surface Construction from Unorganised 3D Point Sets.	Eurographics (Posters)	2012	DBLP DOI BibTeX RDF
18	Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro	Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions	CoRR	2011	DBLP BibTeX RDF
18	Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro	Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.	CCCG	2011	DBLP BibTeX RDF
18	Angel Plaza, Sergio Falcón, José P. Suárez	On the non-degeneracy property of the longest-edge trisection of triangles.	Appl. Math. Comput.	2010	DBLP DOI BibTeX RDF
18	Angel Plaza, Alberto Márquez 0001, Auxiliadora Moreno-González, José P. Suárez	Local refinement based on the 7-triangle longest-edge partition.	Math. Comput. Simul.	2009	DBLP DOI BibTeX RDF
18	Steven Weber 0001, Nihar Jindal, Radha Krishna Ganti, Martin Haenggi	Longest Edge Routing on the Spatial Aloha Graph.	GLOBECOM	2008	DBLP DOI BibTeX RDF
18	Miguel A. Padron, José P. Suárez, Angel Plaza	Refinement based on longest-edge and self-similar four-triangle partitions.	Math. Comput. Simul.	2007	DBLP DOI BibTeX RDF
18	Angel Plaza	The eight-tetrahedra longest-edge partition and Kuhn triangulations.	Comput. Math. Appl.	2007	DBLP DOI BibTeX RDF
18	Angel Plaza, José P. Suárez, Miguel A. Padron, Sergio Falcón, Daniel Amieiro	Mesh quality improvement and other properties in the four-triangles longest-edge partition.	Comput. Aided Geom. Des.	2004	DBLP DOI BibTeX RDF
18	Angel Plaza, Maria-Cecilia Rivara	Mesh Refinement Based on the 8-Tetrahedra Longest- Edge Partition.	IMR	2003	DBLP BibTeX RDF
18	José P. Suárez, Angel Plaza, Graham F. Carey	Propagation Path Properties in Iterative Longest-Edge Refinement.	IMR	2003	DBLP BibTeX RDF
18	Angel Plaza, José P. Suárez, Miguel A. Padron	Mesh Graph Structure for Longest-Edge Refinement Algorithms.	IMR	1998	DBLP BibTeX RDF
18	Can C. Özturan	Worst Case Complexity of Parallel Triangular Mesh Refinement by Longest Edge Bisection.	PPSC	1997	DBLP BibTeX RDF
18	Michael Kaufmann 0001	Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out.	CAAP	1984	DBLP BibTeX RDF
14	Sang Won Bae, Chunseok Lee, Sunghee Choi	On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem.	WALCOM	2009	DBLP DOI BibTeX RDF
14	Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju	Distributed Spanner Construction in Doubling Metric Spaces.	OPODIS	2006	DBLP DOI BibTeX RDF
14	Alon Efrat, Matthew J. Katz	Computing Fair and Bottleneck Matchings in Geormetric Graphs.	ISAAC	1996	DBLP DOI BibTeX RDF
14	Manjit Borah, Robert Michael Owens, Mary Jane Irwin	An edge-based heuristic for Steiner routing.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
14	Christos Levcopoulos, Andrzej Lingas	Covering Polygons with Minimum Number of Rectangles.	STACS	1984	DBLP DOI BibTeX RDF
11	Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa	Exact Algorithms for the Bottleneck Steiner Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
11	Mark Lanthier, Doron Nussbaum, Tsuo-Jung Wang	Computing an approximation of the 1-center problem on weighted terrain surfaces.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	1-Center, meeting point, algorithms, robots, approximation, shortest path, weighted, terrain
11	Tamaghna Acharya, Rajarshi Roy 0001, Samiran Chattopadhyay	Energy-Efficient Broadcasting in Wireless Ad Hoc Networks Using Directional Antennas.	VTC Spring	2008	DBLP DOI BibTeX RDF
11	Mehmet Balman	Tetrahedral Mesh Refinement in Distributed Environments.	ICPP Workshops	2006	DBLP DOI BibTeX RDF
11	Martin Fürer, Shiva Prasad Kasiviswanathan	Approximate Distance Queries in Disk Graphs.	WAOA	2006	DBLP DOI BibTeX RDF
11	Oscar Escalante, Tania Pérez, Julio Solano-González, Ivan Stojmenovic	RNG-based searching and broadcasting algorithms over Internet graphs and peer-to-peer computing systems.	AICCSA	2005	DBLP DOI BibTeX RDF
11	Benjamin F. Gregorski, Joshua G. Senecal, Mark A. Duchaineau, Kenneth I. Joy	Adaptive Extraction of Time-Varying Isosurfaces.	IEEE Trans. Vis. Comput. Graph.	2004	DBLP DOI BibTeX RDF	multiresolution techniques, large isosurface visualization, time-varying isosurfaces, time-varying visualization, Isosurfaces, out-of-core visualization
11	Paolo Cignoni, Fabio Ganovelli, Enrico Gobbetti, Fabio Marton, Federico Ponchio, Roberto Scopigno	Adaptive tetrapuzzles: efficient out-of-core construction and visualization of gigantic multiresolution polygonal models.	ACM Trans. Graph.	2004	DBLP DOI BibTeX RDF	Level of Detail, Out-Of-Core Algorithms
11	Esther M. Arkin, Michael A. Bender, Dongdong Ge	Improved approximation algorithms for the freeze-tag problem.	SPAA	2003	DBLP DOI BibTeX RDF	freeze-tag problem, minimum broadcast-time problem, minimum gossip time problem, multicast problem, scheduling, approximation algorithms, NP-hardness, TSP, data dissemination, swarm robotics, network optimization
11	Peter Lindstrom 0001, Valerio Pascucci	Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization.	IEEE Trans. Vis. Comput. Graph.	2002	DBLP DOI BibTeX RDF	continuous levels of detail, edge bisection, geomorphing, external memory paging, out-of-core algorithms, data layouts, Terrain visualization, surface simplification, error metrics, view-dependent refinement
11	Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	Approximating Shortest Paths on Weighted Polyhedral Surfaces.	Algorithmica	2001	DBLP DOI BibTeX RDF
11	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