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

Bitonic tour

Known as: Optimal bitonic tour 
In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its… Expand
Wikipedia

Related topics

Related topics

7 relations
Computational geometryInternational Olympiad in InformaticsIntroduction to AlgorithmsLexicographical order
Expand

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Performance of the bitonic mergesort network on a Dataflow computer
High speed computing and growing amounts of data are driving the quest for ever faster sorting algorithms. Sorting networks… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
2011
2011
Publication of Little Lion Scientific R & D , Islamabad PAKISTAN DATA BATTLE ON THE DIGITAL FIELD BETWEEN HORSE CAVALRY AND INTERLOPERS
In this paper a novel steganographic method has been proposed to improve the security of embedded data with high capacity and… Expand
  • figure 1
  • figure 1.1
  • figure 2
  • figure 3
  • figure 4
2009
2009
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
We give a systematic study of Hamiltonicity of grids - the graphs induced by finite subsets of vertices of the tilings of the… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2008
Highly Cited
2008
Traveling Salesperson Problems for the Dubins Vehicle
In this paper, we study minimum-time motion planning and routing problems for the Dubins vehicle, i.e., a nonholonomic vehicle… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Highly Cited
2007
Highly Cited
2007
Behavioural Impacts of Mobile Tour Guides
Electronic tour guides have been developed to personalise guided tours. Also, in contrast to traditional tours, electronic tour… Expand
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • table 2
2002
2002
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem
Given an undirected edge-weighted graph and a depot node, postman problems are generally concerned with traversing the edges of… Expand
1996
1996
Guaranteeing full fault coverage for UIO-based testing methods
This paper presents an analysis of the fault coverage provided by the UIO-based methods for testing communications protocols… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1996
1996
L'art à l'épreuve du concept
Ce livre propose un examen critique de la maniere dont la question de la definition de l'art a ete abordee par l'esthetique… Expand
1994
1994
Detection and location for single faults in bitonic sorters
  • T. Lee, J. Chou
  • Proceedings of ICC/SUPERCOMM'94 - International…
  • 1994
    • Corpus ID: 60966720
Bitonic sorters have previously been adopted to construct along with banyan networks the switching fabrics of future broadband… Expand
  • figure 1
  • table 1
  • figure 4
1994
1994
Diagnosis of single faults in bitonic sorters
Bitonic sorters have recently been proposed to construct along with banyan networks the switching fabric of future broadband… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 6
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