**1**

# Calculate objects position in water affected by buoyancy

###
#21
Members - Reputation: **109**

Posted 14 May 2012 - 04:46 PM

###
#22
Crossbones+ - Reputation: **8827**

Posted 14 May 2012 - 04:50 PM

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- *Pessimal Algorithms and Simplexity Analysis*

###
#24
Crossbones+ - Reputation: **2118**

Posted 14 May 2012 - 05:12 PM

If

buoyancy is smaller, it will decelerate still. Think about a ship sinking. It sinks slower than it would fall through air, even though it still sinks.

My advice is just to implement it and see how it goes. Even for light objects

buoyancy will be smaller than the gravity force *for a while*, e.g. until enough of it is submerged to provide a strong buoyancy force.###
#25
Members - Reputation: **109**

Posted 14 May 2012 - 11:23 PM

Its maximum buoyancy would be 9819. The resulting force would be 2452.5 N and the resulting max acceleration would be 3.27 m/s², so it should rise by that acceleration and not sink by(g-resulting acceleration), right?

**Edited by Hairie, 14 May 2012 - 11:33 PM.**

###
#26
Crossbones+ - Reputation: **8827**

Posted 14 May 2012 - 11:59 PM

*tendency*of an object to go in a particular direction. Velocity is the direction the object is

*actually*going. Acceleration affects velocity which affects position (but acceleration never directly affects position).

It won't rise automatically. It will slowly lose downwards velocity, and then start rising back up when the velocity flips signs under the influence of the upwards acceleration.Okay, but, if buyancy is bigger than its gravityforce it should actually start rising with the resulting accelreation and not decelrate by (g-resulting acceleration)? Because if so, it would decelerate even if it had its maximuim bouyancy force. For example if a body had the density 0.75 and a volume 0f 1000, its gravityforce would be 7357.5N.

Its maximum buoyancy would be 9819. The resulting force would be 2452.5 N and the resulting max acceleration would be 3.27 m/s², so it should rise by that acceleration and not sink by(g-resulting acceleration), right?

Imagine a car going at constant speed on a road. Its acceleration is zero. When the car is braking, the brakes force the road to apply friction to the car, which creates a force pointing in the opposite direction of the car's motion. When the car starts losing speed, its acceleration is in fact negative. At some point, its velocity becomes zero, and the car stops. At this point, the car should start going backwards under the negative acceleration it is undergoing (in real life it doesn't happen because of how car brakes work although you can glimpse it by seeing how cars are kind of pushed backwards a bit after quickly decelerating, but are stopped by static friction from the road and brakes).

Short story long, object's don't move from sheer acceleration - acceleration influences velocity which

*then*causes the object to move.

**Edited by Bacterius, 15 May 2012 - 04:25 AM.**

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- *Pessimal Algorithms and Simplexity Analysis*