Ian Parberry
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ian Parberry has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
Timothy Roden
University of Louisiana at Lafayette, Lafayette, LA
5 shared publicationsGene Eu Jan
4 shared publicationsGeorg Schnitger
4 shared publications- Ki-Yin Chang
Department of Merchant Marine, National Taiwan Ocean University, Keelung, Taiwan
3 shared publications Dhanyu Amarasinghe
Dept. of Computer Science & Engineering, University of North Texas, Denton, 76203-5017, USA
2 shared publicationsJonathon Doran
University of North Texas
2 shared publications
Latest Publications
- 1 March 2015
- Published by Elsevier in Entertainment Computing
- Vol. 7, 1-6
Modality specific assessment of video game player’s experience using the Emotiv
- 1 March 2015
- Published by Elsevier in Entertainment Computing
- Vol. 7, 1-6
Modality specific assessment of video game player’s experience using the Emotiv
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 139-143
Real-time rendering of burning solid objects in video games
Objects in 3D games are typically shell models, a polygon mesh representing the shell or skin of the object. While emulation of the behaviour of shell models under combustion is sufficient for many game applications and is fairly well studied, solid objects do in fact burn rather differently than shell objects. We show how to manipulate shell models so that they appear to burn as solid models. Since our burning objects will be only a small part of a video game, computation speed is of the essence. We demonstrate that our method uses only a fraction of the computational power available by implementing the computation on a modest GPU using CUDA.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 139-143
Real-time rendering of burning solid objects in video games
Objects in 3D games are typically shell models, a polygon mesh representing the shell or skin of the object. While emulation of the behaviour of shell models under combustion is sufficient for many game applications and is fairly well studied, solid objects do in fact burn rather differently than shell objects. We show how to manipulate shell models so that they appear to burn as solid models. Since our burning objects will be only a small part of a video game, computation speed is of the essence. We demonstrate that our method uses only a fraction of the computational power available by implementing the computation on a modest GPU using CUDA.
- 2 November 2011
- Published by Taylor & Francis
- p. 79-112
Multiple Coordinate Spaces
- Open Access
- 29 June 2011
- Published by Association for Computing Machinery (ACM)
- p. 256-258
Towards fast, believable real-time rendering of burning objects in video games
- 29 June 2011
- Published by Association for Computing Machinery (ACM)
- p. 256-258
Open AccessTowards fast, believable real-time rendering of burning objects in video games
- Open Access
- 28 June 2011
- Published by Association for Computing Machinery (ACM)
- p. 1-8
A prototype quest generator based on a structural analysis of quests from four MMORPGs
- 28 June 2011
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessA prototype quest generator based on a structural analysis of quests from four MMORPGs
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 424-427
Randomness + Structure = Clutter: A Procedural Object Placement Generator
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 424-427
Randomness + Structure = Clutter: A Procedural Object Placement Generator
- 26 April 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Intelligence and AI in Games
- Vol. 2 (2) , 111-119
Controlled Procedural Terrain Generation Using Software Agents
Procedural terrain generation is used to create landforms for applications such as computer games and flight simulators. While most of the existing work has concentrated on algorithms that generate terrain without input from the user, we explore a more controllable system that uses intelligent agents to generate terrain elevation heightmaps according to designer-defined constraints. This allows the designer to create procedural terrain that has specific properties.
- 26 April 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Intelligence and AI in Games
- Vol. 2 (2) , 111-119
Controlled Procedural Terrain Generation Using Software Agents
Procedural terrain generation is used to create landforms for applications such as computer games and flight simulators. While most of the existing work has concentrated on algorithms that generate terrain without input from the user, we explore a more controllable system that uses intelligent agents to generate terrain elevation heightmaps according to designer-defined constraints. This allows the designer to create procedural terrain that has specific properties.
- 1 August 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ASME Transactions on Mechatronics
- Vol. 13 (4) , 451-460
Optimal Path Planning for Mobile Robot Navigation
Some optimal path planning algorithms for navigating mobile rectangular robot among obstacles and weighted regions are presented. The approach is based on a higher geometry maze routing algorithm. Starting from a top view of a workspace with obstacles, the so-called free workspace is first obtained by virtually expanding the obstacles in the image. After that, an 8-geomerty maze routing algorithm is applied to obtain an optimal collision-free path with linear time and space complexities. The proposed methods cannot only search an optimal path among various terrains but also find an optimal path for the 2-D piano mover's problem with 3 DOF. Furthermore, the algorithm can be easily extended to the dynamic collision avoidance problem among multiple autonomous robots or path planning in the 3-D space.
- 1 August 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ASME Transactions on Mechatronics
- Vol. 13 (4) , 451-460
Optimal Path Planning for Mobile Robot Navigation
Some optimal path planning algorithms for navigating mobile rectangular robot among obstacles and weighted regions are presented. The approach is based on a higher geometry maze routing algorithm. Starting from a top view of a workspace with obstacles, the so-called free workspace is first obtained by virtually expanding the obstacles in the image. After that, an 8-geomerty maze routing algorithm is applied to obtain an optimal collision-free path with linear time and space complexities. The proposed methods cannot only search an optimal path among various terrains but also find an optimal path for the 2-D piano mover's problem with 3 DOF. Furthermore, the algorithm can be easily extended to the dynamic collision avoidance problem among multiple autonomous robots or path planning in the 3-D space.
- 10 December 2007
- Published by Cambridge University Press (CUP) in Journal of Navigation
- Vol. 61 (1) , 31-43
Optimal Interceptions on Two-Dimensional Grids with Obstacles
This article presents efficient and practical methods for path planning of optimal interceptions on two-dimensional grids with obstacles, such as raster charts or non-distorted digital maps. The proposed methods search for optimal paths from sources to multiple moving-targets by a novel higher geometry wave propagation scheme in the grids, instead of the traditional vector scheme in the graphs. By introducing a time-matching scheme, the optimal interception paths from sources to all the moving-targets are obtained among the combinations with linear time and space complexities. Two optimal path planning methods for multiple one-to-one interceptions, the MIN-MAX and MIN-AVG, are applied to emulate the real routing.
- 10 December 2007
- Published by Cambridge University Press (CUP) in Journal of Navigation
- Vol. 61 (1) , 31-43
Optimal Interceptions on Two-Dimensional Grids with Obstacles
This article presents efficient and practical methods for path planning of optimal interceptions on two-dimensional grids with obstacles, such as raster charts or non-distorted digital maps. The proposed methods search for optimal paths from sources to multiple moving-targets by a novel higher geometry wave propagation scheme in the grids, instead of the traditional vector scheme in the graphs. By introducing a time-matching scheme, the optimal interception paths from sources to all the moving-targets are obtained among the combinations with linear time and space complexities. Two optimal path planning methods for multiple one-to-one interceptions, the MIN-MAX and MIN-AVG, are applied to emulate the real routing.
- 1 June 2007
- Published by Elsevier in Science of Computer Programming
- Vol. 67 (1) , 76-90
Toward mobile entertainment: A paradigm for narrative-based audio only games
- 1 June 2007
- Published by Elsevier in Science of Computer Programming
- Vol. 67 (1) , 76-90
Toward mobile entertainment: A paradigm for narrative-based audio only games