Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6650965
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T00:57:16+00:00 2026-05-26T00:57:16+00:00

What algorithm can I use to skew a polygon? Like skewing the following: ____

  • 0

What algorithm can I use to skew a polygon?
Like skewing the following:

 ____
|   _|
|__|

To bottom right will yield

 ____
|    \
|     \
 \    _|
  \__|

its like a shadow cast. I thought about taking every line and making a parallelogram with it and its corresponding line in the skewed position and then union all of these, but that looks a bit brute to do and will take a lot of time.
Is there a better algorithm for this? I already have code for all polygon boolean operations if its needed.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-26T00:57:17+00:00Added an answer on May 26, 2026 at 12:57 am

    I think this algorithm I just thought up will do it:

    Classify every line in the polygon as to whether it is more facing-top-left or facing-bottom-right (or exactly along the skew-direction line).

    Then, for each vertex:

    • If it joins two top-left lines or a top-left line and an exactly-aligned line, then leave it be.
    • If it joins two bottom-right lines or a bottom-right line and an exactly-aligned line, then move it by the skew distance.
    • If it joins a top-left and bottom-right line, then split it into two vertices, one moved and one not.

      This step may cause a self-intersection (such as if the vertex was concave and facing bottom left), in which case discard the two vertices and join the two existing lines with a vertex at their intersection point.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Which checksum algorithm can you recommend in the following use case? I want to
What algorithm I can use for problem like this: Have a graph positive weighted,
I'd like an efficient algorithm (or library) that I can use in Java to
Which algorithm does the JavaScript Array#sort() function use? I understand that it can take
can somebody explain why is the following trivial code (implementation of Euclid's algorithm to
I have a question, what algorithm can I use to generate a set of
I am searching stemming algorithm for Slovenian language that I can use with Sphinx
Anyone know of an algorithm or toolkit for python3 which I can use to
What algorithm can be used to find the longest path in an unweighted directed
I have Fortran-based 3D column-major order array flattened into linear memory. What formula/algorithm can

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.