Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Salles V. G. Magalhães"'
Publikováno v:
Photogrammetric Engineering & Remote Sensing. 83:439-446
Autor:
Jose Augusto M. Nacif, Marcelo M. Menezes, Michael Canesche, Salles V. G. Magalhães, Lucas Braganca, Ricardo Ferreira, Wallace Rosa, Hector P. Baranda
Publikováno v:
Anais do Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD).
As redes reguladoras de genes são modelos baseados em grafos muito utilizadas para estudar o comportamento de células, processos de diferenciação celular ou tratamento e evolução de doenças. Uma rede pode ser implementada por um grafo c
Publikováno v:
Lecture Notes in Computational Science and Engineering ISBN: 9783030139919
IMR
IMR
We present 3D-EPUG-Overlay, a fast, exact, parallel, memory-efficient, algorithm for computing the intersection between two large 3-D triangular meshes with geometric degeneracies. Applications include CAD/CAM, CFD, GIS, and additive manufacturing. 3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::678deb7c35baa9e0388dedfe18f6bb68
https://doi.org/10.1007/978-3-030-13992-6_20
https://doi.org/10.1007/978-3-030-13992-6_20
Publikováno v:
Computers & Graphics. 58:1-11
This paper presents PinMesh, a very fast algorithm with implementation to preprocess a polyhedral mesh, also known as a multi-material mesh, in order to perform 3D point location queries. PinMesh combines several innovative components to efficiently
Publikováno v:
ACM Transactions on Spatial Algorithms and Systems. 2:1-17
This article presents T iled VS, a fast external algorithm and implementation for computing viewsheds. T iled VS is intended for terrains that are too large for internal memory, even more than 100,000×100,000 points. It subdivides the terrain into t
Publikováno v:
Computer-Aided Design. 120:102801
We present 3 D-EPUG-Overlay , a fast, exact, parallel, memory-efficient, algorithm for computing the intersection between two large 3-D triangular meshes with geometric degeneracies. Applications include CAD/CAM, CFD, GIS, and additive manufacturing.
Publikováno v:
SIGSPATIAL/GIS
We present a fast linear time algorithm that uses a block-cut tree for identifying upstream features from a set of starting points in a network. Our implementation has been parallelized and it can process a dataset with 32 million features in less th
Publikováno v:
BigSpatial@SIGSPATIAL
This paper describes data structures and algorithms for efficient implementation of GIS operations for large datasets on multicore Intel CPUs and on NVIDA GPUs. Typical operations are boolean combinations of polygons and map overlay. Efficient parall
Autor:
Guilherme C. Pena, Marcus V. Andrade, Thiago L. Gomes, W. Randolph Franklin, Salles V. G. Magalhães
Publikováno v:
GeoInformatica. 19:671-692
We present EMFlow, a very efficient algorithm and its implementation, to compute the drainage network (i.e. the flow direction and flow accumulation) on huge terrains stored in external memory. Its utility lies in processing the large volume of high
Publikováno v:
BigSpatial@SIGSPATIAL
We present ParCube, which finds the pairwise intersections in a set of millions of congruent cubes. This operation is required when computing boolean combinations of meshes or polyhedra in CAD/CAM and additive manufacturing, and in determining close