Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Procedural generation

Known as: Procedural content generation, Randomly generation, Procedural rendering 
In computing, procedural generation is a method of creating data algorithmically as opposed to manually. In computer graphics, it is also called… Expand
Wikipedia

Related topics

Related topics

50 relations
.kkriegerA Valley Without WindAbyss OdysseyArtificial intelligence (video games)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Creating Training Corpora for NLG Micro-Planners
In this paper, we focus on how to create data-to-text corpora which can support the learning of wide-coverage micro-planners i.e… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2016
Highly Cited
2016
Procedural Content Generation in Games
This book presents the most up-to-date coverage of procedural content generation (PCG) for games, specifically the procedural… Expand
  • figure 1.1
  • figure 1.2
  • figure 2.1
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Experience-Driven Procedural Content Generation
Procedural content generation (PCG) is an increasingly important area of technology within modern human-computer interaction (HCI… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Experience-Driven Procedural Content Generation
Procedural content generation (PCG) is an increasingly important area of technology within modern human-computer interaction (HCI… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Search-Based Procedural Content Generation
Recently, a small number of papers have appeared in which the authors implement stochastic search algorithms, such as… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Procedural Generation of Roads
In this paper, we propose an automatic method for generating roads based on a weighted anisotropic shortest path algorithm. Given… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
CONDENSATION—Conditional Density Propagation for Visual Tracking
  • M. Isard, A. Blake
  • International Journal of Computer Vision
  • 2004
    • Corpus ID: 6821810
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
How to model an internetwork
Graphs are commonly used to model the structure of internetworks, for the study of problems ranging from routing to resource… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1973
Highly Cited
1973
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE