Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Paul Goldsman"'
Publikováno v:
2017 Winter Simulation Conference (WSC).
Publikováno v:
2017 Winter Simulation Conference (WSC).
Autor:
John J. Bartholdi, Paul Goldsman
Publikováno v:
IEEE Transactions on Visualization and Computer Graphics. 10:484-495
We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, t
Autor:
John J. Bartholdi, Paul Goldsman
Publikováno v:
Operations Research Letters. 32:304-308
Triangulated irregular networks (TINs) are common representations of surfaces in computational graphics. We define the dual of a TIN in a special way, based on vertex-adjacency, and show that its Hamiltonian cycle always exists and can be found effic
Autor:
Paul Goldsman, David Goldsman
Publikováno v:
Modeling and Simulation in the Systems Engineering Life Cycle ISBN: 9781447156338
A discrete-event simulation (DES) is characterized by discrete changes in the sim-ulation’s state as the simulation evolves over time. Examples of systems that might be evaluated using DES include: queueing systems, such as a bank service counter,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9bf8f6eb873355b81cb863cbe4b3e402
https://doi.org/10.1007/978-1-4471-5634-5_10
https://doi.org/10.1007/978-1-4471-5634-5_10
Autor:
Paul Goldsman, John J. Bartholdi
Publikováno v:
International Journal of Geographical Information Science. 15:489-522
We describe how to create a continuous global index of the surface of the Earth. The index is based on a hierarchical subdivision of the surface into triangular regions in which each region is assigned a numerical label according to a spacefilling cu
Autor:
John J. Bartholdi, Paul Goldsman
Publikováno v:
Software: Practice and Experience. 31:395-408
We describe a method, based on vertex-labeling, to generate algorithms for manipulating the Hilbert spacefilling curve. The method leads to algorithms for: computing the image of a point in R1; computing a pre-image of a point in R2; drawing a finite