WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Discrete & Computational Geometry
  2. Discrete & Computational Geometry : Volume 53
  3. Discrete & Computational Geometry : Volume 53, Issue 2, March 2015
  4. Closed Rotation Sequences
Loading...

Please wait, while we are loading the content...

Discrete & Computational Geometry : Volume 57
Discrete & Computational Geometry : Volume 56
Discrete & Computational Geometry : Volume 55
Discrete & Computational Geometry : Volume 54
Discrete & Computational Geometry : Volume 53
Discrete & Computational Geometry : Volume 53, Issue 4, June 2015
Discrete & Computational Geometry : Volume 53, Issue 3, April 2015
Discrete & Computational Geometry : Volume 53, Issue 2, March 2015
The Voronoi Conjecture for Parallelohedra with Simply Connected $$\delta $$ -Surfaces
On the Number of Directions Determined by the Common Tangents to a Family of Pairwise Disjoint Convex Sets in the Plane
Fixed-Parameter Complexity and Approximability of Norm Maximization
Average Stretch Factor: How Low Does It Go?
An $$O(\lg \lg {\mathrm {OPT}})$$ -Approximation Algorithm for Multi-guarding Galleries
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity
Closed Rotation Sequences
A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially
Topology of Geometric Joins
Illumination of Pascal’s Hexagrammum and Octagrammum Mysticum
Distinct Distance Estimates and Low Degree Polynomial Partitioning
A Computer Search for Planar Substitution Tilings with $$n$$ -Fold Rotational Symmetry
Tribone Tilings of Triangular Regions that Cover All but Three Holes
A Quadratic Lower Bound for the Convergence Rate in the One-Dimensional Hegselmann–Krause Bounded Confidence Dynamics
Discrete & Computational Geometry : Volume 53, Issue 1, January 2015
Discrete & Computational Geometry : Volume 52
Discrete & Computational Geometry : Volume 51
Discrete & Computational Geometry : Volume 50
Discrete & Computational Geometry : Volume 49
Discrete & Computational Geometry : Volume 48
Discrete & Computational Geometry : Volume 47
Discrete & Computational Geometry : Volume 46
Discrete & Computational Geometry : Volume 45
Discrete & Computational Geometry : Volume 44
Discrete & Computational Geometry : Volume 43
Discrete & Computational Geometry : Volume 42
Discrete & Computational Geometry : Volume 41
Discrete & Computational Geometry : Volume 40
Discrete & Computational Geometry : Volume 39
Discrete & Computational Geometry : Volume 38
Discrete & Computational Geometry : Volume 37
Discrete & Computational Geometry : Volume 36
Discrete & Computational Geometry : Volume 35
Discrete & Computational Geometry : Volume 34
Discrete & Computational Geometry : Volume 33
Discrete & Computational Geometry : Volume 32
Discrete & Computational Geometry : Volume 31
Discrete & Computational Geometry : Volume 30
Discrete & Computational Geometry : Volume 29
Discrete & Computational Geometry : Volume 28
Discrete & Computational Geometry : Volume 27
Discrete & Computational Geometry : Volume 26
Discrete & Computational Geometry : Volume 25
Discrete & Computational Geometry : Volume 24
Discrete & Computational Geometry : Volume 23
Discrete & Computational Geometry : Volume 22
Discrete & Computational Geometry : Volume 21
Discrete & Computational Geometry : Volume 20
Discrete & Computational Geometry : Volume 19
Discrete & Computational Geometry : Volume 18
Discrete & Computational Geometry : Volume 17

Similar Documents

...
On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman

Article

...
Robust Tensegrity Polygons

Article

...
How to Guard Orthogonal Polygons: Diagonal Graphs and Vertex Covers

Article

...
Circumscribed Polygons of Small Area

Article

...
Affine Properties of Convex Equal-Area Polygons

Article

...
Discrete Conics as Distinguished Projective Images of Regular Polygons

Article

...
Flipturning Polygons

Article

...
Untangling Polygons and Graphs

Article

...
Ramified Rectilinear Polygons: Coordinatization by Dendrons

Article

Closed Rotation Sequences

Content Provider Springer Nature Link
Author Bhat, Sanjay P. Crasta, Naveena
Copyright Year 2014
Abstract A finite sequence of rotations is closed if a sequential application of all the rotations from the sequence results in no net orientation change. A complete characterization of closed rotation sequences involving a given set of rotation axes is presented, and the set of such sequences is shown to be a smooth manifold under a nondegeneracy condition on the rotation axes. The characterization is used to derive several examples of closed rotation sequences, some of which are then shown to specialize to classical examples of such sequences provided by the Rodrigues–Hamilton theorem and the Donkin’s theorem. Discrete versions of the Goodman–Robinson and Ishlinskii theorems are also derived and illustrated using the so-called Codman’s paradox.
Ending Page 396
Page Count 31
Starting Page 366
File Format PDF
ISSN 01795376
e-ISSN 14320444
Journal Discrete & Computational Geometry
Issue Number 2
Volume Number 53
Language English
Publisher Springer US
Publisher Date 2014-12-17
Publisher Place Boston
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Codman’s paradox Rotation sequences Ishlinkskii’s theorem Computational Mathematics and Numerical Analysis Rodrigues–Hamilton theorem Donkin’s theorem Orthogonal and unitary groups Goodman–Robinson theorem Kinematics of a rigid body Combinatorics Spherical polygons
Content Type Text
Resource Type Article
Subject Discrete Mathematics and Combinatorics Theoretical Computer Science Computational Theory and Mathematics Geometry and Topology
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...