|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 35 occurrences of 33 keywords
|
|
|
Results
Found 67 publication records. Showing 67 according to the selection in the facets
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 18(1), pp. 111-125, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 15(6), pp. 1603-1610, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 22(2), pp. 111-119, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings, pp. 15, 2008, ACM, 978-1-60558-323-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMR ![In: Proceedings of the 15th International Meshing Roundtable, Birmingham, Alabama, USA, September 17-20, 2006, Proceedings, pp. 543-562, 2006, Springer, 978-3-540-34957-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Naoki Katoh, Takeshi Tokuyama |
Notes on computing peaks in k-levels and parametric spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001, pp. 241-248, 2001, ACM, 1-58113-357-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Kenneth Weiss 0001, Leila De Floriani |
Isodiamond Hierarchies: An Efficient Multiresolution Representation for Isosurfaces and Interval Volumes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 16(4), pp. 583-598, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 369-382, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Maria-Cecilia Rivara, Carlo Calderon |
Lepp Terminal Centroid Method for Quality Triangulation: A Study on a New Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Advances in Geometric Modeling and Processing, 5th International Conference, GMP 2008, Hangzhou, China, April 23-25, 2008. Proceedings, pp. 215-230, 2008, Springer, 978-3-540-79245-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing - GMP 2006, 4th International Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings, pp. 536-544, 2006, Springer, 3-540-36711-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Jeff Erickson 0001 |
Local polyhedra and geometric graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 171-180, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 472, pp. 128631, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Francisco Perdomo, Ángel Plaza |
Similarity Classes of the Longest-Edge Trisection of Triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Axioms ![In: Axioms 12(10), pp. 913, October 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 37(4), pp. 3857-3880, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Sergey Korotov, Lars Fredrik Lund, Jon Eivind Vatne |
Improved Maximum Angle Estimate for Longest-Edge Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Geom. Appl. ![In: Int. J. Comput. Geom. Appl. 31(4), pp. 183-192, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (4) ![In: Computational Science - ICCS 2021 - 21st International Conference, Krakow, Poland, June 16-18, 2021, Proceedings, Part IV, pp. 200-213, 2021, Springer, 978-3-030-77969-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Jonathan Dupuy |
Concurrent Binary Trees (with application to longest edge bisection). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Comput. Graph. Interact. Tech. ![In: Proc. ACM Comput. Graph. Interact. Tech. 3(2), pp. 21:1-21:20, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VISIGRAPP (1: GRAPP) ![In: Proceedings of the 15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, VISIGRAPP 2020, Volume 1: GRAPP, Valletta, Malta, February 27-29, 2020., pp. 368-375, 2020, SCITEPRESS, 978-989-758-402-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Sergey Korotov, Ángel Plaza, José P. Suárez |
Longest-edge n-section algorithms: Properties and open problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Appl. Math. ![In: J. Comput. Appl. Math. 293, pp. 139-146, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Geom. Des. ![In: Comput. Aided Geom. Des. 32, pp. 69-73, 2015. The full citation details ...](Pics/full.jpeg) |
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]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 260, pp. 412-413, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Bilal Hatipoglu, Can C. Özturan |
Parallel Triangular Mesh Refinement by Longest Edge Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Sci. Comput. ![In: SIAM J. Sci. Comput. 37(5), 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 48(2), pp. 134-146, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Informatica ![In: Informatica 26(1), pp. 17-32, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Banff, AB, Canada, June 22-25, 2015, Proceedings, Part II, pp. 445-456, 2015, Springer, 978-3-319-21406-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Carlos Bedregal 0001, Maria-Cecilia Rivara |
Longest-edge algorithms for size-optimal refinement of triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Des. ![In: Comput. Aided Des. 46, pp. 246-251, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. Comput. Program. ![In: Sci. Comput. Program. 90, pp. 34-41, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30 - July 3, 2014, Proceedings, Part II, pp. 115-125, 2014, Springer, 978-3-319-09128-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30 - July 3, 2014, Proceedings, Part II, pp. 104-114, 2014, Springer, 978-3-319-09128-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 221, pp. 424-432, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 224, pp. 492-500, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Hans Achatz, Peter Kleinschmidt |
Computing an Upper Bound for the Longest Edge in an Optimal TSP-Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research Proceedings 2013, Selected Papers of the International Conference on Operations Research, OR2013, organized by the German Operations Research Society (GOR), the Dutch Society of Operations Research (NGB) and Erasmus University Rotterdam, September 3-6, 2013, pp. 1-6, 2013, Springer, 978-3-319-07000-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Simul. ![In: Math. Comput. Simul. 82(12), pp. 2971-2981, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 219(4), pp. 2342-2344, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Lett. ![In: Appl. Math. Lett. 25(12), pp. 2037-2039, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Carlos Bedregal 0001, María Cecilia Rivara |
A Study on Size-Optimal Longest Edge Refinement Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMR ![In: Proceedings of the 21st International Meshing Roundtable, IMR 2012, October 7-10, 2012, San Jose, CA, USA, pp. 121-136, 2012, Springer, 978-3-642-33572-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Stefan Ohrhallinger, Sudhir P. Mudur |
Minimising Longest Edge for Closed Surface Construction from Unorganised 3D Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eurographics (Posters) ![In: 33rd Annual Conference of the European Association for Computer Graphics, Eurographics 2012 - Posters, Cagliari, Sardinia, Italy, May 13-18, 2012, pp. 25-26, 2012, Eurographics Association. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1106.4927, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 216(3), pp. 862-869, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Simul. ![In: Math. Comput. Simul. 79(8), pp. 2444-2457, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Steven Weber 0001, Nihar Jindal, Radha Krishna Ganti, Martin Haenggi |
Longest Edge Routing on the Spatial Aloha Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GLOBECOM ![In: Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November - 4 December 2008, pp. 223-227, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Simul. ![In: Math. Comput. Simul. 75(5-6), pp. 251-262, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Angel Plaza |
The eight-tetrahedra longest-edge partition and Kuhn triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Appl. ![In: Comput. Math. Appl. 54(3), pp. 427-433, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Geom. Des. ![In: Comput. Aided Geom. Des. 21, pp. 353-369, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Angel Plaza, Maria-Cecilia Rivara |
Mesh Refinement Based on the 8-Tetrahedra Longest- Edge Partition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMR ![In: Proceedings of the 12th International Meshing Roundtable, IMR 2003, Santa Fe, New Mexico, USA, September 14-17, 2003, pp. 67-78, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | José P. Suárez, Angel Plaza, Graham F. Carey |
Propagation Path Properties in Iterative Longest-Edge Refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMR ![In: Proceedings of the 12th International Meshing Roundtable, IMR 2003, Santa Fe, New Mexico, USA, September 14-17, 2003, pp. 79-90, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Angel Plaza, José P. Suárez, Miguel A. Padron |
Mesh Graph Structure for Longest-Edge Refinement Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMR ![In: Proceedings of the 7th International Meshing Roundtable, IMR 1998, Dearborn, Michigan, USA, October 26-28, 1998, pp. 335-344, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
18 | Can C. Özturan |
Worst Case Complexity of Parallel Triangular Mesh Refinement by Longest Edge Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSC ![In: Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, PPSC 1997, Hyatt Regency Minneapolis on Nicollel Mall Hotel, Minneapolis, Minnesota, USA, March 14-17, 1997, 1997, SIAM, 0-89871-395-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
18 | Michael Kaufmann 0001 |
Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP'84, 9th Colloquium on Trees in Algebra and Programming, Bordeaux, France, March 5-7, 1984, Proceedings, pp. 169-180, 1984, Cambridge University Press, 0-521-26750-1. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP BibTeX RDF |
|
14 | Sang Won Bae, Chunseok Lee, Sunghee Choi |
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 105-116, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju |
Distributed Spanner Construction in Doubling Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, pp. 157-171, 2006, Springer, 3-540-49990-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Alon Efrat, Matthew J. Katz |
Computing Fair and Bottleneck Matchings in Geormetric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 115-125, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
14 | Manjit Borah, Robert Michael Owens, Mary Jane Irwin |
An edge-based heuristic for Steiner routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(12), pp. 1563-1568, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Christos Levcopoulos, Andrzej Lingas |
Covering Polygons with Minimum Number of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings, pp. 63-72, 1984, Springer, 3-540-12920-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
11 | Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa |
Exact Algorithms for the Bottleneck Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 24-33, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Spring ![In: Proceedings of the 67th IEEE Vehicular Technology Conference, VTC Spring 2008, 11-14 May 2008, Singapore, pp. 36-40, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
11 | Mehmet Balman |
Tetrahedral Mesh Refinement in Distributed Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 2006 International Conference on Parallel Processing Workshops (ICPP Workshops 2006), 14-18 August 2006, Columbus, Ohio, USA, pp. 497-504, 2006, IEEE Computer Society, 0-7695-2637-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Martin Fürer, Shiva Prasad Kasiviswanathan |
Approximate Distance Queries in Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 174-187, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), January 3-6, 2005, Cairo, Egypt, pp. 17, 2005, IEEE Computer Society, 0-7803-8735-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
11 | Benjamin F. Gregorski, Joshua G. Senecal, Mark A. Duchaineau, Kenneth I. Joy |
Adaptive Extraction of Time-Varying Isosurfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 10(6), pp. 683-694, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 23(3), pp. 796-803, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 295-303, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 8(3), pp. 239-254, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 30(4), pp. 527-562, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings, pp. 11-22, 1998, Springer, 3-540-64682-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #67 of 67 (100 per page; Change: )
|
|