Skip to search formSkip to main contentSkip to account menu

Wraparound (video games)

Known as: Wraparound, Wraparound (gaming), Wraparound (video gaming) 
Wraparound, in video games, is a gameplay variation on the single-screen in which space is finite but unbounded; objects leaving one side of the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Giant BombNebulusPipe ManiaSide-scrolling video game

Broader (1)

Video game graphics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Power-efficient deterministic and adaptive routing in torus networks-on-chip
2008
2008
The load balancing problem in OTIS-Hypercube interconnection networks
An interconnection network architecture that promises to be an interesting option for future-generation parallel processing… 
2005
2005
DC performances of ITER NbTi conductors: models vs. measurements
Within the R&D program on the International Thermonuclear Experimental Reactor (ITER) Poloidal Field (PF) coils, a full size… 
2004
2004
Bridging Juvenile Justice and Positive Youth Development
P lacing juvenile justice and positive youth development in the same sentence is somewhat like mixing oil and water. The reader… 
2001
2001
Designing Interactive Theme Park Rides
Pirates of the Caribbean-Battle for the Buccaneer Gold is an interactive theme park ride based on the classic Pirates of the… 
2001
2001
Wraparound: Stories from the Field. Systems of Care: Promising Practices in Children's Mental Health, 2001 Series.
1997
1997
Circuit Switching with Input Queuing: An Analysis for the d-Dimensional Wraparound Mesh and the Hypercube
We analyze circuit switching in a multiprocessor network, where connection requests (or sessions) arrive at each node of the… 
1992
1992
Photonic interconnects for gigabit multicomputer communications
The ways in which photonic and optoelectronic technologies could play an important role in future highly scalable and flexible… 
Highly Cited
1988
Highly Cited
1988
Locality, Communication, and Interconnect Length in Multicomputers
  • P. Vitányi
  • SIAM journal on computing (Print)
  • 1988
  • Corpus ID: 42979090
We derive a lower bound on the average interconnect (edge) length in d-dimensional embeddings of arbitrary graphs, expressed in… 
Review
1981
Review
1981
Frequency domain analysis of wraparound error in fast convolution algorithms
Fast algorithms exist for computing cyclic convolutions. To obtain the linear convolution required for an FIR filter, the data… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)