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 7745847
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 1, 20262026-06-01T10:07:33+00:00 2026-06-01T10:07:33+00:00

I am looking for a point and vector class for simulating particle trajectories in

  • 0

I am looking for a point and vector class for simulating particle trajectories in a Cartesian 3D coordinate system. Functionality needed: compute distances between a point and X, compute intersections between a ray and X, rotate and translate X (where X is a plane or a sphere).

I looked at boost:geometry (too generic, too complicated), at blitz::TinyVector (good base, but lacking geometric functionality), at Qt::QVector3D (perhaps the best starting point).

  • 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-06-01T10:07:34+00:00Added an answer on June 1, 2026 at 10:07 am

    Maybe have a look at cgal It is an extremely powerful geometric library, but also has what you need.

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

Sidebar

Related Questions

I'm looking to implement a reputation-based point system for a QA site. I like
Please pardon my ignorance. I'm looking for a point in the right direction. I
I am looking for an acceptable starting point for placing applications settings in a
I'm looking at upgrading a POS (Point Of Sale) project which is currently built
I'm looking for an algorithm to insert a new control point on a Bézier
Given a floating point number, I'm looking to get a String representation of a
I just wondered if anybody can point me in the right direction: I'm looking
I was looking around some pdf's from a university class and I noticed this
I have a std::vector that holds a Point struct (x,y,z and some other non-pointer
My program has this function: vector<itemPtr> Level::getItemsAt(const Point& pt) { vector<itemPtr> vect(items.size()); // copy

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.